System and method for behavioral model clustering in television usage, targeted advertising via model clustering, and preference programming based on behavioral model clusters

ABSTRACT

The method and system for TV user profile data prediction and modeling allows accurate and narrowly focused behavioral clustering. A client-side system classifies television consumers into representative user profiles. The profiles target individual user advertising and program preference category groups. A contextual behavioral profiling system determines the user&#39;s monitor behavior and content preferences, and the system may be continually updated with user information. A behavioral model database is queried by various system modules. The programming, including targeted advertising for television and interactive television is based on the profile data prediction, modeling and preference determination. The system is enabled to present a complete program sequence to the viewer based on the preference determination and stored programming. The latter is referred to as automatic program sequence (virtual channel) creation and the virtual channel can be presented as a separate channel in an electronic programming guide (EPG).

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application claims the benefit under 35 U.S.C. §119 (e) of provisional application No. 60/260,745, filed Jan. 9, 2001.

[0002] Further reference is had to the disclosures found in the commonly assigned, copending patent application Ser. No. 09/893,192, describing a system and method for delivery of television programs and targeted de-coupled advertising; application Ser. No. 09/096,592 entitled “Television Program Recording with User Preference Determination;” and application Ser. No. 09/953,327, describing logic operators for delivery of targeted programming, and SQL query operators for targeting expressions. The disclosures of the copending applications are herewith incorporated by reference.

BACKGROUND OF THE INVENTION

[0003] 1. Field of the Invention

[0004] The invention lies in the field of interactive television programming. Specifically, the invention pertains to a method and system for TV user profile data prediction and modeling, to a method and system for program and/or advertisement program preference determination, to a method and system for targeted advertising for television and interactive television based on the profile data prediction, modeling and preference determination, and to a method and system with which a complete program sequence can be presented to the viewer based on the preference determination and stored programming. The latter will be referred to as automatic program sequence (Virtual Channel) creation and the virtual channel will be presented as a separate channel in the electronic programming guide (EPG).

[0005] 2. Description of the Prior Art

[0006] Systems and methods to target advertising in interactive television are known. The prior art systems and methods generally target advertising through a statistically sampled, program driven mechanism. Advertising for television is priced in accordance with the rating of a certain program and time slot. Advertisements must be placed so that they reach the intended target audience. The more audience a certain program delivers, and the more clearly focused that audience is with regard to the demographic information, the higher the price for placing the advertisement. By far the most popular TV ratings system currently in use in the United States is Nielsen Media Research. The Nielsen ratings and share system is based on a 5000 member national sample and approximately 50 local market samples. The information gleaned from the national sample is based on a measurement of which program is watched at a certain time in a given television household and by which members of the household. The latter information is determined via so-called People Meters that are installed in the sample households and via which the viewers indicate when they are watching TV at a certain time by pushing a button individually assigned to them. The national sample utilizes rather crude demographic information to define preference ratings for the program determination. The results are published via ratings that are defined relative to the statistical universe (e.g., all television households, male 20 to 40 years, etc.) and by shares. The latter represent a percentage of the universe members watching a given program at the time of its broadcast.

[0007] A slightly more accurate system, referred to as the Portable People Meter, is currently being tested in a limited local television market by Arbitron. The Portable People Meter is a pager-sized electronic transceiver that records a person's television usage via inaudible codes that are superimposed on television programs. At the end of the day, the transceiver is placed on a base station, from which the recorded information is then sent to a central data processing facility.

[0008] In the context of TV user profile data prediction and modeling, the prior art methods and systems do not use program arrival and departure frequency and click timing as preference indicators. Preference ratings in the context of programming predictions are thus rather rudimentary. Since prior art systems do not model transitions, sequential program behavior, and temporal program utilization in a general predictive architecture, they are unable to predict a user's preference based on sophisticated content and temporal relationships.

[0009] By not assessing when there is adequate evidence to infer a preference, known methods tend to incorrectly predict user preferences, or they may wait too long before building higher confidence. Known classification methods require that all feature dimensions of a sample be correlated to the observation, and then assume a Gaussian distribution parameterization to describe group clusters. However, this is inaccurate as the data are not generally subject to normal distribution.

[0010] In the context of program or advertising program preference determination, the prior art methods do not have an automatic user input, and thus no method of learning which metrics best predict a certain user's preference. Further, if preference ratings are available for a given demographic group, they are only stationary weighted and no dynamic weighting adjustment is effected.

[0011] In the context of targeted advertising for television and interactive television, the prior art methods principally use demographic information, not contextual behavioral information as part of the user targeting profile. This reduces targeting performance in non-demographically classifiable consumer groups, and demographic inferring accuracy.

SUMMARY OF THE INVENTION

[0012] It is accordingly an object of the invention to provide system and method for behavioral model clustering in TV usage and targeted advertising and preference programming, which overcomes the above-mentioned disadvantages of the heretofore-known devices and methods of this general type.

[0013] With the foregoing and other objects in view there is provided, in accordance with the invention, a method of determining a television viewer's viewing habits, the method which comprises:

[0014] recording a viewer's monitor behavior with data item variables selected from the group consisting of watch date, watch start time, watch duration, and watch channel;

[0015] inputting historical data information with demographic information tagged to the viewer;

[0016] inputting program guide information; and

[0017] associating the program guide information with the viewer's monitor behavior and defining therefrom a knowledge base with demographic cluster information of the viewer in terms of statistical state machine transition models.

[0018] In accordance with an added feature of the invention, the step of defining the knowledge base comprises calculating a parameterized transition matrix defining the viewer's viewing habits, the transition matrix containing information of program transitions initiated by the viewer. Preferably, at least two concurrent transition matrices are defined, including a channel matrix and a genre matrix.

[0019] In accordance with another feature of the invention, the transition matrix is defined as a two-dimensional matrix with transitions from television channels to television channels in temporal form.

[0020] Preferably, feedback information is provided with the viewer's monitor behavior by recording a click stream.

[0021] In accordance with a further feature of the invention, the viewer's monitor behavior is parameterized with a double random pseudo hidden Markov process, and defining a low-level statistical state machine modeling a behavioral cluster and a top-level statistical state machine with active behavioral clusters and an interaction between the active behavioral clusters. The double random process is defined with a plurality of dimensions, and parallel statistical state machine transition events are determined in at least two of three state categories including channel, genre, and title.

[0022] With the above and other objects in view there is also provided, in accordance with the invention, a machine-readable medium having stored thereon a plurality of processor-executable instructions for implementing a function of:

[0023] capturing state transitions by defining monitor behavior in a plurality of statistical state machine families each representing a given viewer or demographic group viewing behavior;

[0024] combining the statistical state machine families into global statistical state machines defined in a global probability density function;

[0025] updating and reinforcing the global probability density function upon determining that a given probability function has a higher confidence level than a previous probability density function; and

[0026] outputting a global profile based on the global probability density function, wherein the global profile is suitable for determining programming content of a television server.

[0027] The global profile represents demographic cluster information of the viewer in terms of the statistical state machine transition models. The invention provides for TV user profile data prediction and modeling: The resultant behavioral metrics tend to uniquely characterize individuals, and their preferences. The transition processes model user sequences and temporal transition preferences. The invention provides for a method to determine confidence in data quantity, and quality; for an algorithm to determine a distance between non-Gaussian, highly dimensional distributions; and a method to determine adequate separation between clusters for group membership classification.

[0028] The query interface according to the invention provide behavioral preference information to other system modules.

[0029] The novel program or Ad program preference determination uses:

[0030] Weighted fuzzy voting preference metrics based on modeled usage context, content access timing, and content parameter sequencing.

[0031] Frequency reinforced, non-linear preference metric vote weight learning architecture

[0032] Vote aggregation algorithm that determines the top n content parameters (i.e., channels, genres, actors, titles, etc.) by adjusting for vote to vote quality and relative preference trends

[0033] In a further conceptual group, targeted advertising for TV and interactive TV provides for:

[0034] Training method to aggregate users in the target category

[0035] Pruning technique to create the most representative user targeting category template and efficiently download it to the TV client system

[0036] Efficient user targeting category membership determination scheme

[0037] Automatic Virtual Channel program sequence creation using stored preferred programming and presented as a channel in the EPG.:

[0038] Finally, there are provided algorithms to automatically place stored programs and Ads into a virtual channel's EPG (along side normal EPG entries) according to the user's preferred context (i.e., time, sequence, etc.).

[0039] The invention thus provides for a very accurate system of TV user profile data prediction and modeling. Prior art methods do not use program arrival and departure frequency and timings as preference indicators, thus they have less accurate preference ratings. Here, categories such as liked, unliked, and surfing conditions are modeled separately to better match a persons different behavioral meanings for each case. Prior art systems do not model transition, sequential, and temporal in a general predictive architecture. Thus, they are unable to predict a user's preference based on sophisticated content and temporal relationships. By not assessing when there is adequate evidence to infer a preference, known methods tend to incorrectly predict user preferences, or they may wait too long before building higher confidence.

[0040] Known classification methods require that all feature dimensions of a sample be correlated to the observation, and then assume a Gaussian distribution parameterization to describe group clusters. However, this is inaccurate as the data in not generally Normally distributed. The present methods are able to determine clusters separation distances of multi-modal (non-bell shaped) distributions, and saves memory by not preserving each sample point in feature space. Furthermore, prior art methods do not make optimal cluster classification decisions when sample distributions are multi-modal. The system and method of the present invention make more appropriate group classifications as they work with any arbitrary distribution shape.

[0041] Based on the superior and multi-faceted behavior modeling, the invention allows for accurate program or ad program preference determination. By including rich temporal and sequential context information, the present system predicts a user's context dependent preferences. The invention utilizes automatic learning methods, i.e., explicit user input to best predict a certain user's preference. The present system dynamically adjusts preference prediction parameters to use a higher weighting for the most predictive features in rating a content parameter.

[0042] The present system influences preference ratings with sample-to-sample rating trends that prior art systems simply aggregate. By increasing (decreasing) a rating with better (lower) quality samples, a more accurate relative preference metric is achieved. By better modeling preference behavior, therefore, the invention enables far superior advertising and TV program targeting.

[0043] In the context of targeted advertising for TV and interactive TV, the prior art methods principally use demographic information, not contextual behavioral information as part of the user Ad targeting profile. Accordingly, targeting performance is reduced in non-demographically classifiable customer groups, and demographic inferring accuracy. The present system reduces profile size by using a less conservative statistical significance metric, thus further reducing targeting template size, while preserving classification performance, by not downloading statistically erroneous profile information By inferring a TV user's targeting category membership as confidence derated distances from simple local templates, the present method achieves very accurate proportional membership likelihoods because, in contrast with the prior art, template profiles are not wrongly parameterized in statistical terms.

[0044] In addition to accurately classifying the viewers preferences for targeted advertising, the invention further enables the automatic creation of suggested program sequences. Here, we refer to a virtual channel program sequence creation using stored preferred programming. The suggested program sequences can be presented as a separate channel in the electronic programming guide (EPG). The virtual channel is superior to prior art systems in that the user experiences the virtual channel EPG with the same look and feel as any other channel, except the programs and showing times are placed as the user would more like it. The virtual channel provides a higher level of preferential programming that the simple listing of content that is available on the local storage. The novel system gives the TV user the feel of an ‘on demand’ channel.

[0045] In system and business model terms, the present invention is directed to a targeted advertising (Ad) system that provides:

[0046] An innovative clustering mechanism to create and determine the most representative television (TV, refers to a Digital Television or Analog television and Set Top Box receiver combination, both with program storage) user profiles that best target individual user advertising category groups.

[0047] A client-side system to classify a TV user into one, or more, advertising group categories.

[0048] A contextual behavioral profiling system that determines a user's TV usage and content related preferences.

[0049] A behavioral model database that is queried by other system modules for user preferences, supporting behaviorally targeted Ads, preferential virtual channel electronic programming guide (EPG) construction, preferential program storage, and automatic programming recommendations.

[0050] The novel Ad targeting system infers a TV user's advertising category without requiring the viewer to explicitly enter the information. An advertising category, herein, refers to a set of descriptive characteristics that groups a subset of users into categories that can be correlated to a targeting interest of advertisers. Traditionally, these categories have been based on demographic characteristics; however, the present invention expands user modeling, and targeting, to also include behavioral metrics. Thus, a much more robust, and refined Ad targeting system is possible. Apart from prior art, the present targeting system is not program data, but behavior data driven. The fundamental premise of this invention is that persons of a similar category will have certain behaviors that can be modeled and grouped with a significant degree of consistency. The primary underlying aspect of the invention is to develop an accurate model of the dynamic process, so that a clustering engine with a practical set of characteristic dimensions that can efficiently separate, or classify, the vast majority of viewers. In addition to automatically targeting advertising category members, the goal is to apply the behavioral modeling engine and database to determine a TV user's contextual preference for programming and Ads.

[0051] The present invention models TV program viewing as a double random pseudo Hidden Markov process, where there is a hidden, low level, statistical state machine (SSM) modeling a behavioral cluster, and an observable top level SSM that infers the active behavioral clusters and the interaction between them. The system is trained with tagged learning data (e.g., real-time TV click stream data tagged with the demographic identity of viewers) of a statistically representative, TV viewing population sample. The classification model is a hybrid combination of a parameterized random process, heuristics, and several single dimension behavioral metrics. A multiplicity of data quality measures determines the statistical significance of, and confidence in the training and test data.

[0052] The present invention includes an innovative sample size confidence measure. This metric estimates the bias in the random process that drive the SSM, by calculating the ratio of expected state transition coverage assuming state transitions were uniform randomly chosen, to the actual number of different state transitions observed. The ratio represents the state transition focus compared to random, and indicates the degree that there are enough samples to infer a non-uniform random process, specifically a viewer's personality, as meaningfully determining the SSM structure.

[0053] The double random process model has several dimensions to capture a wide variety of typical, but often unique, TV usage behaviors. In the preferred embodiment, each user's action, or selected non-actions, creates parallel SSM transition events in each of three state categories: Channel, Genre, and Title. These state categories are further subdivided into states of liked/unliked, and short_viewing/not_short viewing characteristics. Inside of each categorical state machine described are chronological dimensions that model time sensitive state transitions. The temporal dimensions of the preferred embodiment models transition event chronology using a novel strategy that includes day_of_week, time_of_day, time_after_TV_turn_ON, and time_since_last_change. The TV user's program selection process, when observed through this time and transition sensitive model, detects complex usage patterns that tend to be unique to individuals, and more broadly to interesting classes of individuals. Behavioral sequences greater than one transition, such as channel surfing, and a multiplicity of heuristic distributions, such as session watch times, and psychometric parameters, such as genre curiosity, are used outside of the SSM as dimensions in a pseudo-Euclidean classification space.

[0054] A novel clustering method combines the SSM transition models (using transition matrix parameterization techniques) and non-Gaussian parameter distributions (by defining unique histogram distribution distance measures) to determine user separability through a dimension voting architecture. Each dimension votes two clusters as separate if the mean separation distance between most of the points is greater than their separation variance. Surpassing a certain threshold number of dimensional separation votes determines if the clusters are separate. The percentage of the dimensions that are voted as not separable between two clusters, approximates their amount of overlap.

[0055] In accordance with an added feature of the invention, the clustering engine (CE) software agent resides in a singular, computer system centrally located at the TV distribution head-end (called Admanager) and creates template behavioral profiles that correspond to targeted Adcategories of TV viewers. To learn the most general profile of a particular target group, the CE is trained on only tagged viewing data from that group. The CE generalizes viewer's profiles in each group into a representative aggregation for the respective Adtargeting categories. Adcategory profiles evolve by aggregating all dimensions most strongly in common for the group and most unique across target groups.

[0056] In accordance with another feature of the invention, the prototypical Ad group category, behavioral profiles are innovatively parameterized by the Ad and Ad program information (metadata) distribution organizer part of the Ad manager (called Ad server) to compress the targeting models for the bandwidth-efficient download to advertising category membership agents (MemberAgent) residing in field TVs.

[0057] In accordance with a further feature of the invention, the field TV MemberAgents reconstruct the downloaded parameterized targeting models, and use a similar CE applied to the TV user's history, created by the TV profiling agent (ProfAgent), to determine the most likely Ad categories the user belongs to and put the results in a user category database. TargetingAndStorage Agents and Presentation agents (PresAgent) in the TV combine these targeting category probabilities, and other relevant information (preference info), to selectively capture, store, and display the optimal downloaded advertisements, including videos and banners, to the user.

[0058] The ProfAgent's in the client or field TV's, continually build a knowledgebase of preferences and contextual transition behaviors that profile TV user(s) in the household. The ProfAgent models behavioral interaction with Ads and regular, or entertainment, programs the same way, with, however, possibly different state category names. Preferences for entertainment programs could include affinities for any metadata field or entries in an electronic programming guide (EPG), such as titles, genres, channels, and actors. A transition event occurs between corresponding program EPG entries (e.g., transitioning between programs with different channels and genres, creates a channel and genre transition accordingly. Ads have their version of EPG information that is similar to regular programs. The system learns a user's Ad transition preferences the same way it does for regular programs, except the Ad's genre is its product's Standard Industry Code (SIC), the Ad's title is the product's Universal Product Code (UPC) or SKU code, and the system considers the Ad's actor as the corporate sponsor. Thus the identical data structures and algorithms model user program and Ad transition behaviors.

[0059] This information is provided by the head-end in the Ad's metadata in the same way a program's Content Information metadata and EPG precede the broadcast. Hence, the ProfAgent learns product and sponsoring company preference for Ads in the same way genre and actor preferences are learned, as described in detail herein. This enables the targeting of Ads to not only a user's inferred demographic, but to their specific product, corporate branding, or general product category interests. For example, through SIC the ProfAgent can learn if a user likes financial services, or automobile Ads. Similarly, a Pepsi Cola branding campaign could target users who like the soda SIC, or more specifically Coca Cola named Ads. In another aspect, using the UPC, the Gillette company could target users that specifically liked Ads of a Remington model 3000 electric shaver. In yet another aspect of the targeting system, an Ad agency could target users that, for example, likes Apple Computer Company commercials, but does not otherwise like computer Ads. This user may be entertained by their Ads, but have no interest in their product. This could be an opportunity for the Ad agency to focus an infomercial Ad to the user, to bridge the user from brand awareness to product purchase.

[0060] Over time, a vast relational knowledge base learns very valuable associations between user TV usage behavior, demographics, programs, and Ad preferences. This knowledge base not only increases Ad targeting within the TV, but also has a revenue generation potential by marketing the aggregated personal information to third parties.

[0061] In one instance of the present invention, a TV ProfAgent models patterns of TV usage behaviors with a behavioral model (BM) similar to the clustering engine used at the TV head-end, and extracts key usage information from the BM into a behavioral database. Each entry of the behavioral database has a confidence value generated by a multiplicity of novel techniques presented in detail herein. The database entry confidence registered by the ProfAgent reflects an estimate of the structural and sampling quality of the data used to calculate the database entry.

[0062] The TV receives Ad targeting metadata with restricting query terms to display the associated Ad only to selected user's with database entries matching the query constraints. Each Ad metadata query term has a minimum confidence threshold term that specifies the lowest confidence level in satisfying the query term, or terms, acceptable to display the targeted Ad.

[0063] For example, an Ad targeting constraint such as ‘gender: Male@80% AND age:25-35@50%’ has the effect of only showing the Ad to users the TASAgent predetermined had at least 80% confidence in being a male, and at least 50% confidence in being between 25 and 35 years of age.

[0064] In another aspect of confidence level specification, there is an expression level, confidence threshold as follows: ‘(gender: Male AND age:25-35)@80%’. This targeting mode selects for Ad display only users that the system has at least 80% confidence in being male and between 25 and 35 years of age. These methods provide flexibility by enabling Ads to specify the most important targeting selection terms, or to specify a range of people that are close enough to the desired targeting profile to show the Ad to. The TargetingAndStorage (TASAgent) only selects profiles from the database whose aggregate per dimension confidence rating satisfies the query limits set by the Ad targeting metadata.

[0065] In yet another aspect of the confidence thresholding system, the query selection filter is stated as a Fuzzy Logic, and not Boolean, expression. The targeting query expression is similar to the probabilistic percentage confidence terms with two notable exceptions: fuzzy membership literals replace the percentage terms, and a fuzzy literal table synchronizes client and server.

[0066] By way of example, the query expression mode appears as follows:

[0067] ‘gender: Male@VERY_SURE AND Age:25-35@FAIRLY_SURE’

[0068] This query would select users whom the TASAgent was very sure is a male, and fairly sure lie between 25 and 35 years of age. A fuzzy literal table (FLT) lists the allowable range of fuzzy memberships each advertising category may exhibit. An example of a fuzzy literal table (FLT) is:

[0069] Male: [UNSURE, FAIRLY_SURE,VERY_SURE]

[0070] Age: [UNSURE, FAIRLY_SURE,VERY_SURE, CERTAIN]

[0071] The advantage of the latter expression method is that the novice Ad agency only specifies the degree of confidence required in intuitive, non-mathematical, terms, and leaves the exact range of confidence percentages up to the TSAgent to decide, and continually optimize. Additionally, the fuzzy method handles the non-deterministic meaning of the percentage confidence terms in the database. The TASAgent learns the percentage confidence rating ranges historically associated with each fuzzy performance level.

[0072] Other features which are considered as characteristic for the invention are set forth in the appended claims.

[0073] Although the invention is illustrated and described herein as embodied in a system and method for behavioral model clustering in TV usage and targeted advertising and preference programming, it is nevertheless not intended to be limited to the details shown, since various modifications and structural changes may be made therein without departing from the spirit of the invention and within the scope and range of equivalents of the claims.

[0074] The construction of the invention, however, together with additional objects and advantages thereof will be best understood from the following description of the specific embodiment when read in connection with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0075]FIG. 1 is a block diagram illustrating the most important modules of the system operator part of the system for program or ad targeting, according to the invention;

[0076]FIG. 2 is a block diagram of a behavioral cluster engine, forming a part of the system according to the invention;

[0077]FIG. 3 is a diagrammatic overview over a hidden Markov model with double random processing;

[0078]FIG. 4 is a diagram illustrating a statistical state machine with three state spaces represented in probability density functions;

[0079]FIG. 5 is a diagram of an exemplary channel transition matrix representing a state machine;

[0080]FIG. 6 is a block diagram of a targeting server representing an advertising category, behavioral prototype learning system;

[0081]FIG. 7 is a block diagram expanding on the intra-profile pruning in the cluster aggregator section of the targeting server of FIG. 6;

[0082]FIG. 8 is a block diagram of a client-side advertising category classification system;

[0083]FIG. 9 is a block diagram of an ad targeting system showing the server side and the client side;

[0084]FIG. 10 is a block diagrammatic overview of a preference determination engine architecture;

[0085]FIG. 11 shows three graphs recording various non-surf program watching ratios (with 1657 user inputs);

[0086]FIG. 12 are four graphs recording hopping behavior statistics for 1657 users;

[0087]FIG. 13 is a state sequence model;

[0088]FIG. 14 are four graphs with typical user behavioral statistical distributions with weekly recording of 1657 users; and

[0089]FIG. 15 are four graphs illustrating various additional parameter distributions for the exemplary 1657 users.

DETAILED DESCRIPTION OF THE EMBODIMENTS

[0090] Referring now to the figures of the drawing in detail and first, particularly, to FIG. 1 thereof, there is shown a diagrammatic overview of a system according to the invention. The core of the invention is the application of a hidden Markov chain and user behavior statistics to model and to predict a TV viewer's demographic group and/or the most popular behavior for an individual demographic group. The main goal is to predict a given viewer's demographic group and/or what programs the viewer would like to watch, and to improve the prediction and modeling accuracy as more realtime viewing data become available.

[0091] The system provides two ways to predict a viewer's demographic group, namely, via a dynamic demographic cluster (DDC) knowledge base, and based on similarities between what a viewer watches and the virtual channels predicted by the PDM for the demographic groups.

[0092] As noted above, the primary objects of the invention deal with the targeting of advertising content and program content to a viewer or group of viewers who meet certain demographic requirements if such a requirement is given.

[0093] The system depicted in FIG. 1 is separated into a head end and a client. Programming, ad content, and sequencing of TV content is determined at the head end. The program stream information is transmitted to the client side in a multi-program stream. As indicated by the dashed line, returning from the receiver to the head end, a program selection feedback provides for realtime information regarding the client's viewing behavior. While the feedback connection is generally available in digital cable systems and other direct connection systems, the invention can also be implemented without the direct feedback. Details of the realtime feedback and the sampled feedback embodiments will emerge from the following description.

[0094] The data supplied by outside resources include information concerning the viewing monitor information of all demographic groups which advertiser or content providers may be interested in. Those variables include (a) watch date, (b) watch start time, (c) watch duration, (d) watch channel, and (e) the viewer's demographic information such as age, sex, and the like. The input data further include the information of the incoming electronic program guide (EPG).

[0095] The historical data play a role as a pre-knowledge of the demographic groups. These data define the viewers' behavioral information. The system knowledge is limited to those demographic groups at the beginning.

[0096] The core of the invention—concerning the acquisition of data for the necessary behavioral model—is the demographic cluster knowledge base acquirer based on the hidden Markov model. The input of the module is the behavioral data and, if available, the click stream feedback. The output of the module is the knowledge base in the form of a transition matrix with weight sets that will be discussed in the following text.

[0097] The invention further provides for improvements in the modeling and prediction based on feedback information which includes realtime behavioral data in the form of click streams (e.g., remote control or TV set click sequences).

[0098] Turning now to various details of the novel system, FIG. 2 illustrates a pseudo Euclidean behavioral cluster engine (BCE) architecture according to one embodiment of the present invention. A pseudo hidden Markov model 1 (pHMM) captures behavioral state transitions. An heuristic behavioral metrics (HBM) sub-block 2 algorithmically detects and statistically represents a multiplicity of predictive TV user characteristics. The TV user's TV control stream 3, e.g. remote control click stream, feeds into the pHMM and HBM. These blocks are parameterized into a highly dimensional classification space 5 delivering a spatial cluster of the training data to subsequent modules 6.

[0099]FIG. 3 is a diagram focusing on the pHMM block of FIG. 2. Several statistical state machines work in tandem to model the user click stream. The preferred embodiment has multiple hidden, low level, behavioral processes, and a top-level user transition process. The hidden random processes include channel, genre, and liked title state spaces operating in parallel. The top-level random process, or statistical state machine (SSM), models the likelihood that certain behavioral process activations, and other heuristic behavioral factors, infer a particular user. Each state space has a temporally sensitive transition subspace that tracks various time-dependent user behaviors.

[0100] The pseudo Euclidean Behavioral Clustering Engine (BCE) architecture of FIG. 1 represents one embodiment of the present invention. It includes a pseudo Hidden Markov Model (pHMM) to capture behavioral, state transition. In general, the ‘pseudo’ qualifier indicates this system departs from traditional definition, but maintains substantial similarities as enumerated after a brief description of the HMM.

[0101] A HMM is a doubly random process that has an underlying random process that is not observable and therefore, hidden. However, some aspects of this hidden process are observable through another random process or a set of random processes. The observed random process produces a sequence of symbols, in the present case likely user categories, that we may measure with certain statistical properties. The model seeks to describe both the short time variations in the random process, as well as the steady state features. Of particular concern are the transitions from one interval to another. We generally assume that statistical laws govern the observed temporal variations in the TV viewing process.

[0102] The goal of the BCE is to model and group the TV usage and content selection, time series data patterns generated by a TV remote control, or TV, buttons pressed, herein referred to as ‘click-stream’. There are two forms of click-stream data; they are real-time and statistically sampled.

[0103] Real-time data is what the actual TV system registers from the user TV control commands. This data is sampled at a high rate, and can be any TV control button and it may be accumulated temporarily in a file for later use.

[0104] Statistically sampled data are recorded by a third part, such as Nielsen or Arbitron, it generally has detailed user information, limited time resolution, and only logs channel changes of a statistically representative sub-group of the TV viewing population.

[0105] Two primary aspects of the Ad targeting system directly depend on click-stream data. First, the profiling agent (ProfAgent) on the TV models TV users through a real-time click-stream and program content information or electronic programming guide (EPG) data. Second, the BCE uses statistically sampled click-stream data and corresponding past EPG data to build advertising category behavioral clusters. All statistically sampled TV user data in the present document, use digitally recorded market research by BARB TV Research corp. (London England) of 1650 British satellite TV users over a six month period in 1998.

[0106] A plurality of heuristic measures estimate user preference for TV programs, categories of programming, and certain user behaviors. With these preference measures, a preference determination engine (PDE) uses a voting based, reinforced learning system to assign preference ratings to all EPG entries.

[0107] The preference determination engine (PDE), the architecture of which is illustrated in FIG. 10, provides likes predictors for all demographic groups, i.e., for a group instead of an individual person. The difference between a person and a group is that the determination engine has to pick up the programs which will please a majority of the people in a demographic group for a particular time. Additional details of the implementation of the PDE may be found in the commonly assigned, copending patent application Ser. No. [Attorney Docket No. P02408US], which is herewith incorporated by reference.

[0108] The group probability may be determined as follows: $P_{C_{t}}^{t} = {\frac{1}{N}{\overset{N}{\sum\limits_{j}}P_{C_{t,j}}^{t}}}$

[0109] where P_(C) _(i,j) ^(t) is the probability that a person j of a demographic group i likes the program on channel C at time t; N is the number of persons in the demographic group i, who have the highest probability of watching channel C at the time t.

[0110] Then, the channel picked up is the one with highest P_(C) _(i) ^(t)

[0111] The preference determination engine architecture illustrated in FIG. 10 includes a plurality of preference sensing filters 10 (PSF), a behavioral model database 11 (BMdbase), a voting generation layer, output voting weights, and a reinforced teaching mechanism. Each preference sensor filters user behavioral patterns into an analog value proportional to the degree the targeted behavior occurs. The PSF and pHMM receive user click-stream data from a click stream sensor 12, and dynamically maintain the BMdbase 11. The present BM embodiment includes the following novel PSF as defined in the following items:

[0112] 1. Time_watched/Time_available, for non-surfing, and non-hopping programs

[0113] 2. Time_missed/Time_available, for all non-surfing programs

[0114] 3. Time_left/Time_available, for all non-surfing programs

[0115] 4. Time_watched/Time_available, for programs with hopping

[0116] 5. Time_between_hops, for programs with hopping

[0117] 6. Number of hops per program

[0118] 7. Time independent visitation bias all EPG entries

[0119] 8. Time in program (TIP) visitation bias for all EPG entries

[0120] 9. Time in session (TIS) visitation bias for all EPG entries

[0121] 10. Time of day (TOD) visitation bias for all EPG entries

[0122] 11. Day of week (DOW) visitation bias for all EPG entries.

[0123] While the terms are self-explanatory, we provide a definition of terms as follows:

[0124] In item 1, the term time_watched (T_(w)) is the total watch time, possibly not contiguous, for a particular program. Time_available (T_(a)) is the program length. The ratio Time_watched/Time_available (T_(w)/T_(a)) indicates how much of a program the user viewed, and statistically reflects their interest in the content.

[0125] In item 2, the term Time_missed (T_(m)) is the amount of a time a user comes late to a program (negative if early). The ratio Time_missed/Time_available (T_(m)/T_(a)) reflects the users eagerness, and possible planning, to see the start of the program, hence a greater program preference than if the user often starts late. If negative, it is an especially strong indicator that the user spent more effort in planning, and hence has a greater preference, to see the program's start.

[0126] In item 3, the term Time_left (T_(l)) is the time of the program's end minus the time the user leaves the program (negative if stayed after end). Time_left/Time_available (T_(l)/T_(a)) is a ratio to gauge a user's interest in not missing the program's end, hence a greater preference for the program than if the user often leaves early.

[0127] Taken together, these measures determine the quantity and quality of possible time spent watching a program. As shown in FIG. 10, most people tend to tightly group in each of these metric. The result is a good correlation with program preference. Exactly similar conclusion and measures as T_(w)/T_(a), T_(m)/T_(a), and T_(l)/T_(a) applies for advertisements as well as programs.

[0128] Preference metrics related to program hopping, items 4 through 6, estimate program preference in relation to the hopping behavior. A program hop is the act of leaving and returning to the same program. A program surf is the act of going to, and leaving from a program within a certain short period of time, e.g., 5 minutes. When a user returns to a program, that is a strong indicator that there is something about the program worth returning to, or liked. FIG. 11a graphs the T_(w)/T_(a) for programs with hopping. It will be understood that programs with hopping are watched longer than those in the non-hop case. A hop indication thus is an indication of greater preference.

[0129] In item 5, the term Time_between_hops designates the time (in minutes) the user was away from the original program before returning. As illustrated, most users had hops that were less than 2% of the program. Beyond the intuitive appeal of this metric, this data combined with the above preference bias for programs with hopping, demonstrate at tendency that the shorter the time away, the more the user prefers the original program.

[0130] With a similar intuitive and observational appeal, the number of hops per program of item 6 is an inversely proportional proxy for user program preference. That is, the more often a user hops back and forth in a program, the less they like the program. FIG. 11c indicates that most people hop only once or twice in a program with any hopping. It is important to note, that the higher frequencies of hopping are increasingly rare, and thus not preferred since most hopped programs have a relatively high T_(w)/T_(a) ratio.

[0131] Yet another novel class of program preference metrics are based on a unique method to determine user behavioral bias, items 7 through 11. User bias, as used herein, is the prejudicial focus of behaviors to select a significantly limited subset of possible choices. With this concept as the motivation, bias takes the theoretical form of a ratio of the expected uniformly random selection spread verses the observed behavioral selection spread. User behavioral bias is a psychometric tool that measures the psychological bias of a user to choose a target behavior over other options in its behavioral domain. A mathematical treatment of the bias metric subsequently follows a summary of its application in user program preferences.

[0132] The behavioral bias metric can determine if a selection in question has enough evidence to infer that user selection is a preferred action. More specifically, it indicates the likelihood of a non-uniformly random selection process. For example, if the selection of a certain channel occurs with the same likelihood as random, then there is no evidence of a user selection bias, and the channel is assumed as not preferred. In the converse situation of the selection being several times more likely than random, then the channel is deemed preferred.

[0133] Similarly, the preference vote of item 7, returns the overall bias to visit any particular EPG entry. Items 8 to 11 are temporally restricted bias queries.

[0134] Item 9 returns a vote on the bias to make a certain selection at a specified time after the start of a TV viewing session. A session is the TV usage period that starts at the turn on, and ends at the turn off of the TV. A visitation bias is the content, or category, visitation frequency over random.

[0135] Similarly, item 10 restricts the bias query to the time of day, and item 11 is a day of the week selection preference query vote. The prescribed bias metrics are superior to the prior art in that the latter calculate absolute frequencies of something happening and not the relative likelihood of a particular observed event frequency occurring. In any short period of time a uniformly random process can appear to prefer some possibilities over others and trick a frequency based preference determining system to infer a user preference. However, in such a circumstance, the present bias detection scheme would indicate there are insufficient samples or they are not concentrated enough to infer a user preference. This has the effect of lowering the confidence in the poor quality, visitation frequency based metrics, and lowers their contribution to the final program preference evaluation; thus increasing accuracy by rejecting statistically erroneous sample data.

[0136] In addition to EPG entry related preference, several behavior related preferences are contemplated, such as those described herein. Behavioral preferences provide a mechanism to make program preference predictions in the context of a user's past patterns of action. It is often the case that a viewer's mood, or contextual circumstances including temporal queues, can influence preferences in a way that has a program liked in one context, and not preferred in another. To the extent the BCE models the behavioral context of interest, a more accurate programming preference prediction is possible.

[0137] The behavioral model database BMdbase 11 of FIG. 10 is serviced by a standardized behavior model query engine. The corresponding target query of the behavioral model (BM) data will now be described in the following:

[0138] All modeled behaviors and temporal relationships in the BCE, as described herein, serve as the BMdbase for system modules to query with the viewer's real-time usage pattern in a TV session, and not simply make the estimation using the users average preference for a program. The BMdbase is a behavioral preference query server to any system module requiring certain behavioral likelihoods to make a more optimal decision. Modules that query the BMdbase include the preference determination agent (PDE) 13, the TASAgent, and the PresAgent. The behavioral model query engine (BMQengine) services all search queries to the BMdbase.

[0139] Any environment state variable (such as TV volume), or EPG entry (e.g., channels), or their derivatives, is potentially a hyperplane in dimension 1, below, of the behavioral model. The preferred behavioral transition model has five dimensions (Dim) as follows:

[0140] Dim 1—[likedTitle, likedChannels, unlikedChannels, surfchannels, likedGenres, unlikedGenres, surfGenres]

[0141] Dim 2—[from State code, i.e., channel, or genre, or Title ID number]

[0142] Dim 3—[to State code, i.e., channel, or genre, or Title ID number]

[0143] Dim 4—[nonTemporal, DOW, TOD, TIS, TIP]

[0144] Dim 5—[temporal fuzzy bin]

[0145] Dim 1 selects the type of state variable.

[0146] Dim 2 sets a constraint for the ‘from’ state of interest with the reference ID. A ‘from’ state is the state the viewer leaves when making a state transition.

[0147] Dim 3 sets the ‘to’ state ID for the query. The ‘to’ state is defined exactly as the ‘from’ state, except it is the state a viewer goes to upon a state transition. The reference IDs could be channel call letters, such as ‘ABC’, genre names such as ‘movie’, or title hash codes.

[0148] Dim 4, the type of temporal relationship; and,

[0149] Dim 5 the corresponding time interval; e.g., valid selections for DOW are: Mon., Tue., Wed., Thurs., Fri. Sat. and Sun.

[0150] There are approximately 14 to 16 fuzzy membership categories that provide a dependable fuzzy model. The number of members within the categories may be set to vary from about seven for relatively unimportant membership categories (time_left/time_watched ratio), to about 17 for the most important categories (e.g., time watched).

[0151] In addition to BM search constraints, there are functional specifications (specs). Function specs include, but are not limited to, the following:

[0152] QueryFunction—[mostLikely, leastLikely, Top_n, Bot_n, time_sum]

[0153] The ‘most’ (least) likely search function returns the highest (lowest) probability states and bias values that satisfy the rest of the query constraints. ‘Top_n’ (Bot_n) returns number ‘n’ the highest (lowest) probability states and bias values that satisfy the rest of the query constraints. The ‘time_sum’ function aggregates all the bias terms (by averaging, or counting, etc.) in each specified TimeType's TimeValue intervals. Thus, a general transition query format is:

[0154] ‘[QueryFunction] [StateType] [fromStateID] [to StateID] [TimeType] [TimeValue]’

[0155] By way of example, the following query searches for the top 5 liked genres on Sunday:

[0156] ‘QueryFunction=Top_n=5, StateType=LikedGenres, fromStateID=null, toStateID=null, TimeType=DOW, TimeValue=Sunday’

[0157] A typical query result, where 100 is the maximum preference, is

[0158] [action=60, news=40, comedy=30, null, null]

[0159] if only three genres were liked on Sundays.

[0160] A typical use of ‘time_sum’ is to search for the most likely time of activity for a given StateType. For example: Find the top 3 most likely times of day a user watches TV. The query is

[0161] ‘Query Function=time_sum, StateType=LikedChannels, fromStateID=null, toStateID=null, TimeType=TOD, TimeValue=null’.

[0162] In this case, the ‘time_sum’ function will aggregate all transition biases per TOD interval, and return a list of results. If the person is most active in the mornings, evenings, and late night then a typical query response could be (‘;’ implies a new row, and ‘,’ a new column):

[0163] [(late_night,very_often); (wee_hours, never); (early_morning; never); (morning, mostly); (late_morning; rarely); (after_noon; rarely); (late_after_noon; sometimes); (evening; almost_always); (night, typically)]

[0164] A module with a defuzification table searches the returned matrix for the top three likelihoods, namely,

[0165] [(morning, always); (late_night,very_often); (evening; almost_always)].

[0166] A multitude of standardized query interfacing are readily practical to interface with the BMQengine. For example, a SQL interface would specify the dimensional attributes as ‘SELECT . . . FROM . . . WHERE’ clauses; e.g., If the most likely, or popular, TIME for watching MOVIE.ACTION is in the evening, the SQL query is:

[0167] (SELECT view_start_time FROM preferences

[0168] WHERE genre_main ‘movie’

[0169] AND genre_sub=‘action’

[0170] AND view_day_of_week=(SELECT view_day_of_week FROM preferences

[0171] WHERE genre_main=‘movie’

[0172] AND genre_sub=‘action’

[0173] GROUP BY view_day_of_week

[0174] HAVING MAX(BIASview_day_of_week));)

[0175] GROUP BY view_start_time

[0176] HAVING MAX(BIAS_view_start_time));

[0177] )=9 pm

[0178] A basic SQL interpreter converts SQL search parameters into BMQengine dimensional attribute constraints. For this example,

[0179] QueryFunction=mostLikely, StateType=LikedGenre, fromStateID=null,

[0180] toStateID=movie:action, TimeType=TOD, TimeValue=evening.

[0181] Although a wide variety of modeled behaviors, and query architectures are contemplated, there are still many others. The following is a general enumeration of some behavioral preference categories. Here, the outputs depend on the real-time viewing context:

[0182] 1. Time sensitive transition preferences for all EPG entries

[0183] 2. State-sequencing

[0184] 3. Transition reversal bias

[0185] 4. Time watched per session, and per all EPG entries

[0186] 5. TV control patterns of behavior

[0187] 6. T_(w)/T_(a), T_(m)/T_(a), and T_(l)/T_(a) for all EPG entries

[0188] 7. EPG entry and behavioral diversity focus (breadth, depth search control)

[0189] 8. Most likely starting, or ending, state

[0190] In item 1 the BM produces time sensitive, and time independent transition likelihoods for any EPG entry. Every EPG entry class is further segmented into a plurality of behavioral categories, including surf/non-surf, hopping, and liked/unliked states, as previously defined. Each user action creates transition statistics in each of these domains according to the SSM algorithm.

[0191] An example, is a query to the BMQengine for the likelihood that a particular actor (or any EPG field entry) is watched after watching the news (or any other EPG field entry), with no time constraints. A typical time sensitive preference query would look like:

[0192] ‘what is the likelihood of watching sports on Monday (or any day)

[0193] AND

[0194] in the evening (or any time),

[0195] AND

[0196] after watching TV for an hour (or any amount of TV watched time),

[0197] AND

[0198] while half way into the current program (or any amount of program watched time).

[0199] Importantly, the query can be relaxed with less conjunctive terms, or tightened with more constraints. Using this mechanism, a system module can pass the real-time contextual information to the BMQengine, and discover that although the user loves sports in general, he/she does not like to watch it on Monday evenings within an hour of watching TV, midway into another program. This highly specific case is a demonstration of the high detail of learning and contextual preference possible in the present system. The system module send the full range of query abstraction levels, i.e., from very general (e.g., find liked genres), to a fully conjunctive EPG, temporal, and state sequencing likelihood search. The system module finds the most likely level of query abstraction, and rates programming by their distance from its query parameters.

[0200] For example, if a sports program is to be rated, the first, and most abstract query, might be ‘is sports liked’, then subsequent queries will increasingly add constraining terms depending on the real-time context, like ‘is sports liked on Monday evenings after watching the news’, and an even more specific query might add ‘on channel 2’ to the latter query, and so on. If the last, and more specific, query was most likely, then a sports programs on Monday evening, after watching channel 2 news would rate higher than the same sports program if these behavioral constraints were not met. In the PDE query case, the closer (farther) a program is to the most likely behavioral constraint, the higher (lower) the behavioral voting contribution is to the PDE rating.

[0201] In yet another aspect of item 1, the BMQengine supports a query for the most likely transition given a modeled context parameters (i.e., EPG entries, timings, behaviors). The BMQengine responds with all probabilities that match the query terms, assuming unconstrained model dimensions are a wildcard. Thus, the BMQengine recursively applies the constrained dimensions across all unconstrained behavioral dimensions. For demonstration sake, we assume the BM models day-of-week (DOW), and time-of-day (TOD) for liked titles, channels, and genres. A typical query and response appears as follows.

[0202] Query: ‘what are the most likely genre transition from genre=weather, DOW=Monday, and TOD=evening’.

[0203] Exemplary response: ‘genre=comedy, bias=medium’.

[0204] If any term is not specified, then the BMQengine searches all entries of the unconstrained dimension for query matches. For example, if DOW was omitted from the last query, then each evening would be searched for the most likely transition genre from ‘weather’. A possible query response is ‘[genre=drama, DOW=Tuesday, bias=high]’, if the most likely transition from genre=weather is to a drama is on Tuesday. If the control term of the last query ‘most likely’ was changed to ‘all’, then every destination genre during any evening with a transition from weather would be returned.

[0205] The same mechanism provides for finding the typical amount of time a user tends to hop away from a liked program. This behavior could arise from skipping commercials, or time sharing with consistently competing content. An example of a query to find the top 2 most likely hopping times for the program named “Seinfeld” appears as follows:

[0206] Query: [QueryFunction=top_n=2, StateType=Title, fromStateID=null, toStateID=‘Seinfeld’, TimeType=TIP, TimeValue=NULL]. If the person usually only skips Ad breaks at 2 minutes, and 15 minutes after the start of Seinfeld, in 30 and 50% respectively of all transitions to the show, then the fuzzy time bin, query response would be [(QUICKLY_SURFING,30); (VERY_SHORT,50)].

[0207] Using transition context information enables the PDE to assign better program preference ratings, and permits the PresAgent to order programs on a virtual channel in a user preferred program order and time.

[0208] A state-sequencing query, item 2, addresses the likelihood that selected EPG entries are part of a preferred state sequence, and returns the probabilities and states observed. A state-sequence is defined as any contiguous set of state transitions greater than one. Each modeled state transition matrix has a companion state sequence table. Instead of storing the actual permeation of observed state sequences, state sequence table logs the states visited and their frequencies. Since human behavior rarely repeats with exacting precision, it is more important to parameterize transition sequences to match behavioral tendencies. Thus, there are two ordered tables. One two-dimensional table has its rows as the unique combination of visited states in an observed sequence, and the columns are the IDs of the visited states. The rows are sorted by column vector length, and the columns are alpha-numerically sorted. This sorting speeds searching the table for a given query pattern. A corresponding table, effectively a third dimension, accumulates the number of times a state was visited in the sequence. Each time the same combination of states are visited in a transition sequence, the per state visitation frequencies are added to this count. An, effective, fourth dimension accumulates the sequence lengths of sequences of matching visited states. A fifth, and final, sequence modeling dimension counts the number of times a particular state sequence combination row occurs. This dimension is used to calculate the average sequence length, and average number of times a state in a sequence was revisited. A state visitation sequence match occurs when the states visited in a new sequence exactly matches a states visited row entry. When a match occurs, the state visitation frequencies, and sequence length, are added to their respective dimensional accumulators. Otherwise, a new row entry is appropriately created.

[0209]FIG. 13 illustrates a typical example. The example is for channel states, but the algorithm applies to any state sequence modeling. FIG. 13A shows an originally empty database after processing two sample state sequences. The two sequences have at least one different visited state, resulting in two new row entries. In FIG. 13B, two additional sequence examples are processed. Sequence three, although not the same as sequence one, is aggregated into the same row entry as sequence one, since exactly the same states were visited. Sequence four differs by one state, thus a new dbase entry is created. Sorting columns and rows continually, or periodically, makes query searches more efficient.

[0210] A typical sequence (Sequ) likelihood query format appears as follows:

[0211] [QueryFunction] [StateType] [sequStateIDs] [LengthValue]

[0212] The ‘QueryFunction’ term has the same parameters as the transition query case. Additional ‘StateType’ attributes identifies the type of state sequence to select, e.g.: ChannelSequ, GenreSequ, TitleSequ, SurfGenreSequ, SurfChannelSequ, or any EPG entry such as ActorSequ, etc. The query constraint terms ‘FromStateIDs’ and ‘toStateIDs’ are similar to the prior transition query case, except they each are a list of either already visited, or yet to be visited states, respectively. The query term ‘LengthValue’ constrains the average sequence length to search for. Some typical sequence related BMQengine query examples follow.

EXAMPLE 1

[0213] Find the top 5 most likely channels that complete a non-surfing viewing sequence, given the previously visited channels 30 and 40, the query constraints are

[0214] QueryFunction=top_n=5, StateType=ChannelSequ, sequStateIDs=[30,40], LengthValue=null.

[0215] If channels 43, 58, and 60 were the most likely to complete the sequence, and their probabilities are 80, 10, 20 and percent respectively, the query result would be:

[0216] [(43,80), (58,10), (60,20), null, null].

EXAMPLE 2

[0217] Find the top 5 most likely channels that complete a surfing sequence three channels in length, given the previously visited channels 30 and 40, the query constraints are

[0218] QueryFunction=top_n=5, StateType=SurfChannelSequ, sequStateIDs=[30,40], LengthValue=3.

[0219] If only channel 43 was the most likely to complete a surfing sequence three channels in length, and its probability is 80, the query result would be

[0220] [(43,80), null, null, null, null].

EXAMPLE 3

[0221] Out of all sequences of at least 4 programs, find the probability of watching the following three programs sequentially—Friends, Frasier, and Seinfeld (assuming they were chronologically concurrent or consecutive).

[0222] QueryFunction=mostLikely, StateType=TitleSequ, fromStateIDs=[“Friends”, “Seinfeld”, “Frasier”], LengthValue=4.

[0223] A typical query result if these query constraints were observed in 20% of all sequences with LengthValue at least equal to 4, is [20].

[0224] In each of these examples, the channel, or sequence probabilities are calculated by simply counting the number of times a query satisfying state was visited, out of the total number of similarly constrained records. A more complete model of behavioral sequences additionally includes single transition information to statistically infer the most likely permutation. The novel sequence modeling method set forth employs the ‘states-visited’ model information, above, to infer observed combinations, and BM state transition information to estimate the most likely permutations, i.e. sequence order. The advantage of this sequence modeling method, is to significantly filter noisy behavioral sequencing data, and save memory, while preserving characteristic state sequencing information. It is well know that the memory requirement of storing all possible permutations of numerical sequence grows with the factorial of sequence length. In the TV environment this is often a prohibitive, and wasteful use of limited resources. A pessimistic estimated probability of a particular sequence order occurring is approximately equal to the product of the probability of matching sequence parameters (i.e., length, states, and states visitation frequencies), and the probability of each transition occurring. Since each sequence transition is not independent of the prior one, this estimate is clearly a lower bound. A variety of heuristics are contemplated for comparing the relative likelihood of one permutation over another by considering the directional bias of each transition. In short, a permutation is more likely if its transition directions have a significant bias over the reverse direction. A simple heuristic to calculate an ordering likelihood metric is to sum the difference of the forward minus the reverse direction transition bias for each sequence step.

[0225] With this information, a system module can estimate the expected likelihood that a state is in a specified sequence. For example, if a TV user starts viewing CNN, and switches to FOX, a query to the BMQengine could return the most likely channels to come, and there likelihoods. As shown in more detail herein, this information could be used by the PDE to bias the preference of a program, or a program's sequential placement by the PresAgent in a virtual channel.

[0226] Transition reversal bias, item 3, seeks to detect any directional bias to a user's state transition behavior. An example is if a viewer tends to move from CNN to PBS, but rarely from PBS to CNN. Similarly, for genres, a user may prefer to more often watch news before long drama movies. Many such preference may arise in Titles, or any EPG entry. System modules sensitive to program sequencing can use reversal bias to predict the viewer's preferred programming order. The PDE uses the directional bias to influence a program's preference rating to the transition context of a viewer's recent history. For example, assume a user just watched news, and the PDE must calculate the most preferred programs in the EPG to suggest for viewing. In the case where the PDE otherwise rates programs on CNN and PBS equally, it would rate the PBS program high if there was a significant transition bias from CNN to PBS over the reverse case. MemberAgent uses this as a behavioral parameter to identify classes of viewers. State directional bias assists the PresAgent to better sequence the program guide for virtual channels.

[0227] Information such as typical time watched, item 4, per EPG entry and TV session, helps system modules better match a viewer's attention span for specific types of content. If a viewer tends to have short TV viewing sessions, then shorter programs get higher ratings than longer ones. If a user tends to watch action movies for a much shorter time than comedies, then programs in the respective categories are incrementally preferred accordingly. In principle, attention span applies to all EPG entries, and most principally to channel, genre, title, and actors. Attention span potentially separates viewers (for the MemberAgent), and directly effects their preferred mix of content viewing times (for the PDE and PresAgent).

[0228] Monitoring TV control patterns, listed in item 5, is a significant tool in identifying users behaviorally, and often motivates program preference conclusions. A typical example is modeling a users control behavior of the mute and volume buttons. The PDE uses the mute button as an indicator of less preferred programming. In the context of Ad watching behavior, the MemberAgent uses the mute button to learn types of Ads a user may not like. Other TV control buttons, such as volume control, offers similar predictive potential. If a users raises the volume of a certain program, then they are more likely to like that program. With respect to user identification, teenagers may be more likely to significantly raise the volume of music videos than mid-aged adults. Similar, modeling and query mechanisms as in temporal modeling applies, except time interval plains are substituted for the appropriate control parameter intervals.

[0229] The same T_(w)/T_(a), T_(m)/T_(a), and T_(l)/T_(a) in program preference ratings, similarly apply to behavioral preference ratings, as in item 6. Through a user's viewing history, any EPG entry will have an inferred preference associated the user's program viewing behavior. For example, if a viewer is often late in watching programs with a certain actor, then the state corresponding to this actor would have a high T_(m)/T_(a) ratio. Similarly, for every combination of PSF and EPG entry SSM.

[0230] As a further metric, item 7 brings forward the importance of curiosity, and diversity psychometric behavioral parameters. Diversity measures seeks to characterize a user's spatial coverage in each domain of interest. Any modeled state domain receives a focus rating calculated by dividing the selections visited by the total selections available, during a certain period of time; e.g., channel_diversity=number_of_channels_visited/total_number_of_channels. Different behavioral state classes, or EPG entries, have their own diversity measures; e.g., genre diversity etc. Different people tend to have a wide range of domain diversity measures that characterize them. Older people may have fewer channels they watch than teenagers, for example. Similar to diversity measures, focus measures apply to cross dimensional, often hybrid, domains. These hybrids are often behavioral derivatives of EPG entries, and not direct measurements of EPG selection spreads. For example, Channel Sequence and surfing focus, measure how few unique states make up all observed sequences or surfing. Another psychometric class are curiosity measures. Curiosity measures estimate a users psychological tendency to explore a particular category of content. For example, channel_curiosity is the ratio of the number of liked channels, out of all channels non-surfed. The lower this ratio, the more the user explores channels that they have not previously liked. A person who is not very curious, would tend to stick only to things that they have liked in the past, and would have a very low curiosity rating.

[0231] The preference determination engine PDE uses diversity, focus, and curiosity metrics to determine the appropriate mix of highly rated programs to suggest for viewing. Taken together, these measures control the breadth, and depth of programming predictions presented to the viewer. For example, if a viewer has a low genre diversity rating, the PDE would concentrate top program suggestions within the fewest number of genre categories, and conversely if the rating was high. People tend to have a predictable range of diversity and curiosity ratios. As used by MemberAgent, the combination of these measures tends to separate individuals and the classes they belong to. With respect to the PDE, if, for example, their channel curiosity rating is high, the PDE gives suggestion preference to channels not previously watched often. The PresAgent, having a similar task as the PDE, creates virtual program viewing guide that tends to match the daily variation and novelty that a user prefers.

[0232] The most likely starting, or ending, state of item 8 is an important parameter for all modules. The PDE uses starting, or ending state likelihoods to bias program ratings to according user history when turning on and off the TV. These parameters, also, help identify users for the TASAgent. The PDE couples ending state information with session duration predictions to bias programs towards ending state preferences as the actual session time approaches and surpass the expected TV session end time. The PresAgent applies a similar principle when constructing a time appropriate virtual programming guide. For example, if at a certain time and programming state, a user often end their session on a certain channel, then any programming on that channel will get a preference rating bias. In general, such rating biases are relatively small, and are meant to give preference to programs that are otherwise closely rated, but have some contextual bias, such as sequencing.

[0233] It will be understood that the above are exemplary embodiments and implementations of the invention only. A wide variety of permutations and variations on the preference metrics are well within the scope of this invention.

[0234] The following description provides details concerning the behavioral model processing according to the invention.

[0235] With reference to FIGS. 2 and 3, each user's action, or selected non-actions, creates parallel SSM transition events in each of three SSM state spaces: Channel, Genre, and Title. These state space categories each have temporally dependent and independent dimensions. The first dimension, from top to bottom, is time independent, and notes any state transitions whenever they occur. The second SSM dimension tracks the time_n_program, namely, how long since the last transition, a state transition occurs at. Dimension three models transitions relative to the time since the start of a TV session. The fourth SSM dimension detects time of day patterns of behavior, and the fifth day of the week. The goal is to detect periodic sequential events that have some degree of relative temporal or sequential bias. Each state space dimension has a transition matrix acting as fuzzy bins to quantify the temporal membership to which a state transition sequence belongs.

[0236] For example, the Time of Day dimension for the channel, genre, and title SSMs, consists of mutually exclusive transition matrices that enter each state transition in one of the following time matrices:

[0237] Late_Night, Wee_Hours, Early_Morning, Morning, Late_Morning, After_Noon, Late_After_Noon, Evening, Night

[0238]FIG. 4 graphs an instance of the preferred state space, and the legal transition flows within each statistical state machine (SSM). Inside any of the probability density functions there exists only one state at a time. The SSMs of the preferred embodiment are liked titles, channels, and genres; and unliked channels, and genres; and surf channels, and genres. Each SSM contains fixed and variable states. Fixed states describe transitions between SSMs.

[0239] The first fixed state for all SSMs is the OFF state. The OFF state occurs when the TV is off.

[0240] The SSMs modeling liked state transitions have as the second fixed state the UNLIKED state.

[0241] Conversely, the SSMs modeling unliked state transitions have as the second fixed the LIKED state. Channels and genres viewed for less than a certain threshold amount of time, e.g. 5 minutes, count as surfing transitions.

[0242] The non-surfing SSMs have a third fixed state called SURFING. The state SURFING is active when the user views a program for less than the surfing threshold. The channel and genre surfing SSMs have only the OFF and NOT_SURFING fixed states. Variable states for state spaces are ideally all states possible to visit. However, practical resource constraints often significantly limit the number of states that can be fully modeled. One method to compress the BM without significant errors is to only have the most representative, or preferred, of each state space included and enumerated as variable states in the SSMs.

[0243] A preference determination engine (PDE)—see FIG. 10—assigns preference ratings to titles, channels, and genres. The maximum number of states resources permits are taken from the top ratings in each category. States in surfing SSM models are a union of liked and unliked SSM states. As with any state machine, the SSM can only be in one state at a time. For example, when viewing a liked channel and transition to an unliked one, the ‘to’ state would be the UNLIKED fixed state of the Liked Channel SSM, and the ‘from’ state in the Unliked Channel SSM is the LIKED fixed state.

[0244] Transitions between variable states define the block named probability density function, or ‘pdf’, as it models the likelihood for any particular behavioral state transition to occur. Variable states are added to and deleted from the pdf depending on their statistical significance over time. In practice, most TV viewers may individually visit fewer than 30 of 100 channels and 50 of 100 genres over the course of six months. Using this observation, a systems designer under limited systems memory constraints can significantly reduce system resource requirements, and yet continue to capture the vast majority of a user's behavior. Up to a certain limit, the present invention's performance is proportional to, thus scalable with, the number of top preferred states in the SSM. The lower limit on the number of required states tends to come from minimum required performance on individuals that are very similar, but different in very subtle ways. The upper limit is set by the diminishing performance benefit of adding states, verses the penalty of system resource constraints. To find an optimal limit, a simulation sweeps model resource parameters over a statistically representative population sample of TV viewing behaviors. Such memory usage optimizations are most critical in the TV ProfAgent. In a real-time model building mode, A certain number of temporary states are continually necessary as the ProfAgent builds enough evidence to determine which to include into the SSM, or reject as not active enough. Upon reaching an available memory limit, the agent deletes the least preferred states, as determined by a unique algorithm in the PDE.

[0245] When a user makes a content transition, a state transition event is registered as described in each respective SSM. An action-based transition is any explicit TV control button pressed; e.g., a channel change, or volume increase. A non-action event occurs when content changes with no explicit user action; e.g., new program on same channel. In the latter case, a new program event causes a self transition on any other state that stayed the same, i.e., a steady channel is a channel state self transition. Another possible case is no channel change, but the same liked program title repeats itself. In this case, all SSMs will have a self-transition in their last state. Importantly, self-transition to programs that are short enough to be otherwise counted as surfing, are counted as non-surfing transition. This choice follows the philosophy of heuristically modeling the users behavioral intent.

[0246]FIG. 5 details a representative state space SSM matrix, of FIG. 4, and its operation. The rows represent the ‘from’ state, and columns the ‘to’ state of a state transition. The process may be referred to as a dynamic demographic cluster knowledge base in terms of transition matrix and weight set (TNWS)

[0247] The transition matrix, in principle, describes the viewers' behavior in a kind of temporal form. The transition matrix illustrated in FIG. 5 is a channel transition matrix. The dimension of the matrix is A×A. A is the number of channels available plus 2.

[0248] The number of different types of matrices is 2, one is for channel—as shown in FIG. 5—one is for genre.

[0249] There are two sets of matrices for each day of the week for every demographic group, i.e. there exist 14 matrices for channel group i (i=1,2,3 . . . N; N the number of groups). One set for watching activities, another for surfing.

[0250] The matrix in FIG. 5 shows the following transitions: On→Ch.5→Ch.2→Ch.6→Ch.100→Off. An item in the matrix (A, B, C, D, E) is the median of all $\frac{WatchedDuration}{ProgramDuration}$

[0251] of the demographic group for the action, e.g. transition from channel 5 to channel 2. Items in the on-column and off-column and those matrix for surfing are counts for the action.

[0252] Based on the transition matrix it is possible to predict a demographic group. After building the transition matrix, weight sets have to be optimized for all demographic groups. The optimization is based on maximum entropy theory and reinforcement learning.

[0253] On the client side, the prediction is effected the same way unless there is a memory restriction. If that is the case, entropy evaluation will be used to eliminate those columns which are less important. The weighting items discussed later are optimized and fixed for the client to use. However, if the client has more computation power than it can consume, it can optimize those weight sets and keep them locally.

[0254] By way of example, we take a watched channel transition matrix H_(C) _(i j) where i is a channel; j a group, is the entropy of a to channel, i.e., a column, in a channel transition matrix. Note that the lower the entropy is, the higher value of information content the column has. A lower H_(C) _(i j) means that there exists a valuable to transfers value for this channel. Ideally, H_(C) _(i j) , i=1,2,3 . . . N, j=1,2, . . . M, N the number of channels and M the number of groups, are different for groups, which means that the transition matrix will help to identify viewers' demographic group.

[0255] The final goal is to obtain a probability P_(J) for a viewer, then picks up $\frac{\max \quad P_{j}}{j}$

[0256] as j the predicted group for the viewer.

[0257] The probability P_(J) can be derived from two sets of transition matrix with the transition matrix of the viewer as follows:

[0258] First, calculate H_(X) _(i,j) where X are channel and genre, also for both watching and surfing, i.e. X takes 4 values.

[0259] Calculate N_(X) _(i j) which is the entropy of from, i.e. the rows.

[0260] Then, calculate the probability distribution for both columns and rows ${{P_{H_{s_{j}}}\left( a_{i,j} \right)}\quad a_{i,j}} = {{\frac{1}{H_{X_{i,j}}}\quad {and}\quad {P_{N_{x_{j}}}\left( b_{i,j} \right)}\quad b_{i,j}} = \frac{1}{N_{X_{i,j}}}}$

[0261] Next, create a weight matrix W_(H) _(J) of every transition matrix for all groups. The items w_(x,y) in the matrix are ${w_{x,y} - \frac{w_{x,y}^{1}}{\sum\limits_{x,y}w_{x,y}^{1}}};{w_{x,y}^{1} = {{P_{H_{j}}\left( a_{x,y} \right)}*{P_{N_{j}}\left( a_{x,y} \right)}}}$

[0262]  where w_(x,y) is the weight for one transition action.

[0263] Now, calculate a weighted item distance between knowledge base and viewers' transition matrix $D_{j}^{L} = {\sum\limits_{x,y}{{{L_{x,y}^{k} - L_{x,y}^{P}}}w_{x,y}^{L}}}$

[0264]  where L is one of the transition matrices. The terms L^(K) and L^(P) are L matrices for knowledge base and viewer respectively.

[0265] Finally, reinforcement learning should be utilized, e.g. Monte Carlo type, to optimize W_(J) ^(L) for the best result. A good result is that the viewer's group is predicted correctly. $P_{j} = {{\underset{L}{\sum\limits^{M}}{D_{j}^{L}*W_{j}^{L}\quad {\sum\limits_{L}W_{j}^{L}}}} = 1}$

[0266] There are two types of receiver with which the system can operate, one with feedback channel, one without. The optional feedback channel is indicated as a dashed line in FIG. 1. If a receiver with feedback channel provides demographic information, the task of demographic group based advertisement is quite straightforward, as will be described in the following. Also, the performance of the advertisement is easy to measure. If the receiver does not provide demographic information of the viewers, it will be treated the same way as a receiver without feedback channel, apart from the way of gathering the performance which can be obtained by the feedback channel directly.

[0267] For receivers without the feedback channel, two methods are provided for determining viewers' demographic group. Which one to use depends on closer match principle of the two, which is measured by maximum entropy measure on P_(J) of the above discussion. The method which produces smaller entropy value should be used. The performance of those receivers without feedback channel should be measured by market research, then put into the learning circle as those with feedback channels.

[0268] The realtime feedback of viewer's action with demographic and performance info, of course, exists only when a back channel exists for a viewer's receiver. It contains information of the viewer's behavior information stream and the performance of the demographic prediction.

[0269] The behavior stream should contain at least the items listed above, namely, watch_date, watch_start_time, watch_duration, watch_channel, and demographic information. The performance is a temporal list to indicate whether the receiver's prediction is right or not.

[0270] Since the demographic information of the receivers are known, the knowledge base acquirer (see central box in FIG. 1) can make changes based on the feedback information.

[0271] In summary, therefore, FIG. 5 is a representative non-temporal state space SSM matrix, and its operation. The exemplary channel state space uses the transition from OFF to channels 5, 2, 6, and 100, and back to the OFF state starting from an empty matrix. The ProfAgent increments the appropriate transition matrix entry for each state pair. For the present example, the following (from,to) matrix entries would be incremented (5,on), (5,2), (2,6), (6,100), and (100,off). The number of times visiting channel 5, is the sum of all of the entries in column 1 (,the global probability is that number divided by the matrix totals. Once on channel 5, the probability to go to channel 2 is the counts of (5,3) divided by the sum of row 5 (channel 5 from states).

[0272] A similar process governs the accumulation and analysis of higher dimensional transition matrices such as temporal. The mechanism is identical, except the entry in the appropriate time interval plane of the transition is incremented. An important difference between the pseudo HMM implementation, and the theoretical HMM is that the state transitions in the Markov chain are not necessarily independent of the last state. Thus, the probability to traverse through a state sequence is not necessarily equal to the product of the individual state transition probabilities. It is a lower bound, however. To the extent the user state selection behavior is uniformly random, the pHMM converges towards the theoretical HMM. The lack of transition independence does not extinguish the utility of a partial random state machine model as user selection behavior tends to be Gaussian, however, it does require additional statistical information to compensate. Sequence modeling, as described herein, is such an attempt.

[0273] The preference determination and the profile modeling described in the foregoing may be applied in a variety of contexts. Here, we concentrate on the targeting of advertising content based on the preference ratings and profile modeling.

[0274]FIG. 6 illustrates the advertising category, cluster learning architecture that is applied in the targeting server. The BCE creates m-clusters from m users from a particular advertising category training set. The Cluster Aggregator block extracts the most representative aspects of the learned clusters and creates a typical profile of the group. After training over n Ad categories, n typical advertising category behavioral profiles are created. That is, FIG. 6 depicts an advertising category, behavioral prototype learning system, i.e., the top level advertising category, cluster learning architecture. The module resides at the head-end Ad Manager, inside the targeting server. Cluster learning is a continual process of defining and optimizing advertising category groups (clusters), and their correlated behavioral profiles based on high quality tagged and sampled TV user logged data. The demographic, behavioral data are either input from a third party, and/or field deployed units. A selection filter extracts the targeted advertising category at the training set for the BCE. The BCE processes each user record in the training set as if they were from the same user, thus creating a very large aggregate BM. The resulting BM is parameterized, and pruned to a subset of only highly biased dimensions that serve as the representative behavioral signature for the advertising category. This step is referred to as inter-prototype pruning, since it only removes bad, insufficiently biased, dimensions within a given BM. The BCE repeats this procedure for each training cluster, until every advertising category group has a corresponding behavioral signature profile, if one exists. A typical advertising category profile will exist if, and only if, there is at least one behavioral dimension significantly biased over random. Each SSM has a corresponding set of novel parameterizations of generic, characteristic state transition behaviors that tend to separate users.

[0275]FIG. 7 depicts the pruning phase of advertising category template building. This phase distances the prototypes by removing the dimensions most in common dimensions among the categories. The second stage, herein called intra-prototype pruning or intra-profile pruning, of advertising category behavioral prototype building removes dimensions in each BM that are similar to all other corresponding BM dimensions. This step selects the most distinctive dimensions across all targeting reference profiles, hence creating a minimal description length for each advertising category prototype. If the result of this pruning process is to remove all, or significantly all, of a prototype's classification dimensions, then the most similar Ad categories are merged into a single predictive class, thus diminishing the best targeting resolution of the system to the merged Ad categories. For example, if insufficient dimensional distance separates three male age groups in their 20's, 30' and 40's, then these Ad classes are merged into a single class of males between 20 and 40 years old. The targeting server sends the final targeting Ad profile prototypes, their category labels, and expected prediction performance to the Ad Server.

[0276] The detailed aspects of the novel training, pruning, and merging process follow. The BCE begins the training process by building the BM with labeled user data from the selected targeting group members. The BCE calculates transition and certain behavioral patterns from each user action. Transition counting events supported by the BM include changes in any program EPG entries, occurring at various relative time measures. A minimal event training log appears as:

[0277] <user ID> <date> <time> <channel> <genre> <title> <program length>

[0278] Since the training set is a preexisting database, learning occurs in batch mode, instead of real-time. In batch mode, all viewed programs within a certain learning window, are rated and sorted at once. The BM simulation steps the learning window over the user data, or learning period. With real-time data, a temporary holding area is necessary while building sufficient evidence to include the transition into a statistical state machine SSM. The learning window determines the temporal performance of the system. On the server side, there is generally no memory limitation, thus no need to delete possibly less preferred states to include new observations. The main effect of the learning window is to estimate the client-side BM performance over a range of memory limited user history periods. A goal of the present invention is to identify stationary behavioral parameters, and their typical variance. When the probability density function for the random variable is a function of time, the random process is said to be non-stationary. To determine the statistical stability period for the group non-stationary random process behavior, the learning window is continuously adjusted from a few days, to a few months. The approximate stationary period is the learning window size that has the best correlation between window steps. Every advertising category potentially has a different average stationary period. For example, senior citizens may have more repeatable behavior, for a wider interval of time than teenagers. The targeting server provides the Ad server with the expected learning times needed to approach prediction stability, and convergence for each advertising category.

[0279]FIG. 8 diagrams the real-time advertising category estimation system. The MemberAgent compares the real-time TV user's usage behavior to the advertising category templates and calculates a probability distribution of the user's advertising category.

[0280]FIG. 9 outlines the TV Ad targeting system according to the preferred embodiment. The TASAgent receives Ads from the TV head-end, and interprets the Ads targeting metadata. The TASAgent compares the target audience, specified by the Ad's targeting query expression, against items selected from the household users advertising category predictions data, and produces a targeting rating that the TASAgent, and PresAgent use to determine which Ads should be stored, and displayed respectively.

[0281] Referring now to FIG. 10, there is illustrated the preference determination engine architecture according to the invention. The profiling agent (ProfAgent) incrementally updates the behavioral model BM with each content change event. Initially, the event is decomposed into its states, if any, and temporal relationships. Liked states are any modeled aspects, characteristics or usage, associated with a liked program. The ProfAgent receives program preference ratings from the preference determination engine (PDE). The PDE determines a liked program by evaluating the voting network in FIG. 10. There are three main components to the PDE, real-time content and context preference learning (ProfAgent), preference prediction (PredictAgent), and a BMQagent. A description of the PredictAgent follows the ProfAgent overview. The output is a perceptron-like weighted linear, fuzzy voting, combination of the previously enumerated preference sensing filters (PSF):

[0282] The ProfAgent Learning Algorithm

[0283] Initialization

[0284] 1. Set all n weights equal to 1/n

[0285] 2. Set ρ, δ, and η to conservative estimates (e.g., ρ_(p)=ρ_(n)=0, η_(p)=0.1, η_(n)=δ=0.05)

[0286] Where ρ is a trial dependent learning momentum term. η is a trial independent learning rate. The n and p subscripts correspond to a negative and positive event, respectively.

[0287] Calculation of Output Activation O

[0288] 3. O=Σw₁*V₁, for all i=1 to n

[0289] Where V_(i) is the PSF fuzzy output vote.

[0290] Weight Training

[0291] 4. For each positive event:

[0292] w₁(t+1)=w_(i)(t)+η_(p)w₁(t), for all V₁≧θ

[0293] w₁(t+1)=w₁(t)−η_(p)w_(i)(t), for all V₁<θ

[0294] 5. For each negative event:

[0295] w₁(t+1)=w₁(t)−η_(n)w₁(t), for all V₁≧θ

[0296] w₁(t+1)=w_(i)(t)+η_(n)w_(i)(t), for all V₁<θ

[0297] θ is the minimum fuzzy liking vote threshold.

[0298] Update learning rate

[0299] 6. If positive event:

[0300] ρ_(p)(t+1)=ρ_(p)(t)+ρ_(p)(t)*(O(t)−O(t−1)/MAX_VOTE)

[0301] η_(p)(t+1)=η_(p)(t)+η_(p)(t)* ρ_(p)(t+1)+δ

[0302] η_(n)(t+1)=η_(n)(t)−η_(n)(t)* ρ_(p)(t+1)−δ

[0303] 7. If a negative event:

[0304] ρ_(n)(t+1)=ρ_(n)(t)+ρ_(n)(t)*(O(t−1)−O(t)/MAX_VOTE)

[0305] η_(n)(t+1)=η_(n)(t)+η_(n)(t)* ρ_(n)(t+1)+δ

[0306] η_(p)(t+1)=η_(p)(t)−η_(p)(t)* ρ_(n)(t+1)−δ

[0307] δ is a frequency reinforcing term

[0308] The ProfAgent adjusts weights of the single layer, n node network according to a reinforced learning scheme. The n weights, preferably user specific, are initialized equally to 1/n; i.e., all PSFs have an equal vote. Each time the user visits the same program, the training regime reinforces nodes that vote the program as liked, and penalizes the rest. This philosophy confirms preference predictions with observational frequency. To encourage stability and convergence, a learning rate η applies an incremental reinforcement signal to adjust weights. Two learning rates govern the training process, a negative (η_(n)) and positive (η_(p)) event rate. A positive event is when the user selects the program, and a negative event is when a program was available in a previously liked context, but another program was chosen. In practice, there is more causal information in positive examples, than negative ones. Hence, the η_(p) is normally much higher than η_(n). The momentum term ρ_(p) (ρ_(n)) increases (decreases) training rewards when the preference voting output indicates an increasing (decreasing) preference trend between positive (negative) events, and lowers η_(n) (η_(p)) to reflect a positive (negative) learning bias. The δ learning rate term reinforces program visitation frequency. The reinforcement is positive for each positive event, and negative otherwise. Over time, the present preference learning system automatically learns the PSFs that best predict program preference, and de-emphasize the rest. The learning rates are adjusted to approximate the time constant of user periodic preference shifts. All PSFs output a fuzzy preference rating range in steps from a minimum rating value(e.g., HATES_PROGRAM=1), to a maximum (e.g., TOP_PROGRAM=MAX_VOTE=6).

[0309] θ is the value of the minimum fuzzy membership that indicates at least a program liking (e.g., V₁=LIKES_PROGRAM/MAX_VOTE=4/6=0.66). PSF reinforcement is determined by comparing a PSF's vote to θ. A vote is positive when V₁≧θ, and is negative otherwise. The effect is to reward a PSF voting weight if it voted positive (negative) during a positive (negative) program viewing event, and penalize it otherwise.

[0310] The PDE calculates the program, or any state type, preference rating, R, as follows:

[0311] If the program is already a state in a SSM: $\begin{matrix} {R = {\frac{\left( {1 + {\lambda (t)}} \right)}{t - q}{\sum\limits_{k = {t - q}}^{t}{c_{k}O_{k}}}}} & (1) \end{matrix}$

[0312] O_(k) is the chronologically ordered array of preference votes for the program

[0313] t is the number of recent ratings for the program, t points to current vote O.

[0314] q is the number of past ratings to include in the moving average

[0315] c is a temporal weighting coefficient array, where c_(k<)=1

[0316] λ(t) is a trial independent, but frequency dependant biasing term, where λ(t)<=1

[0317] If the program is not already a state in a SSM

[0318] R=O

[0319] The preference rating R of a program is a weighted moving average of the current and past program preference votes. A system designer skilled in the art sets the c_(k) distribution to the desired temporal bias of past ratings. Typically, time diminishes the value of past information, hence ratings decrease in value over time. λ(t) proportionately increases the overall rating according to the number of times the program has been rated. λ(t) is preferably a small and slow growing function of viewing frequency; e.g., λ(t)=c*log(t)=[0 0.03 0.05 0.1 0.12. 0.15 . . . ]. The effect of λ(t) is to indicate greater preference for a program the more times it is watched, independent of the PSF votes.

[0320] For example, if a viewer always watches only the first 20 minutes of the Tonight Show, the program's rating would be low, however the frequency term λ(t) would increasingly raise, say logarithmically, the rating to reflect the consistency of viewing preference; e.g., a 3% higher rating after 3 times, and 12% after 5 viewings, etc. All state types related to a program inherit the program's effective preference vote, O.

[0321] For example, if the program has a LIKED rating, then its genre, channel, actor, etc. likewise receive a LIKED rating. The PDE calculates a state candidate's preference rating, R, as described for the Title example above, shown in Equation (1). For example, if a user watched two comedy series, ‘Seinfeld’ with a LIKED rating, and then a good while later the user watched ‘Friends’ with an INTERESTED rating, then O₁=LIKED=4, and O₂=INTERESTED=3, then the comedy_series state preference rating is (with c₁=0.9, c₂=1, λ(2)=0.03): $R = {{\frac{\left( {1 + {\lambda (2)}} \right)}{2}\left( {{c_{1}O_{1}} + {c_{2}O_{2}}} \right)} = {\frac{1.03\left( {{{.9}*4} + {1*3}} \right)}{2} = 3.4}}$

[0322] In this case, since there was a long time in between program viewing events, the older vote was reduced by 10%. However, since the same genre was viewed twice, the rating received a 3% increase. The same preference rating algorithm applies to any state type.

[0323] For each program viewed, the PDE passes a candidate state preference rating to the ProfAgent to update the BM according to the prescribed algorithms. The PDE directs the BCE to process all user training data, as if from one user, thus creating a single BM including behavioral information for all class members.

[0324] The voting output of the ProfAgent is stored in a voting history database (VOTEdbase), that the ProfAgent uses, as described herein, to determine the most preferred states to keep in the BMdbase. The PredictAgent also uses the VOTEdbase when responding to requests by the Preference Determination Agent PrefAgent for rating content parameter preferences. The PrefAgent and its function is described in the commonly assigned, copending patent application [Docket No. 155785-0006/P01862, based on provisional applications 60/215,450 and 60/226,437]. The disclosure of the copending application is herewith incorporated by reference.

[0325] A recording manager causes the recording of programs by periodically initiating a recording sequence. For that purpose, the recording manager sends a request to the preference agent PrefAgent for ratings of all programs at a particular time (X), or alternatively, for ratings of all programs within a particular time period (X). In certain embodiments, the frequency with which the steps are performed may be changeable by the user. The preference agent responds by providing ratings, from a preference database, for each program received from the recording manager. The recording manager then causes recordation of the programs at time X, or within time period X in accordance with the ratings received from the preference agent.

[0326] The preference agent monitors the viewing selection of the various viewers using the control system and creates viewing profiles of each viewer that are stored in the preference database. Based upon these profiles, the preference agent sorts through the incoming programming content as described in the EPG information to compile lists such as “Top 10” lists of viewing choices available at any given time to each viewer, and directs the recording manager to record the top-ranked program being broadcast at any given time (including any programs selected by the viewers for recording) and store it in a stored programs memory device. The preference agent further contains software that allows it to create a demographic profile for each viewer, based upon the viewing profile of the viewer and certain algorithms or associative rules. These algorithms may be adjusted over time as the model employed by the system administrator is enhanced and its accuracy improves. To this end, the system update information channel included in the broadcast signal may include periodic software updates, including new preference database parameters that may need to be included at the request of the advertising suppliers. Thus, in one embodiment the control system may be remotely upgraded to meet any new demands that may arise as advertising content providers become familiar with the system and the process of custom tailoring narrowly focused, targeted advertisements. The demographic profile created for each viewer is stored in a demographic database, which resides in the control system and thus ensures the viewers' privacy.

[0327] The preference agent also sorts through the advertising content streaming in through multiple advertising channels contained within the broadcast signal and, based upon the demographic profiles of the viewers and the meta data contained in each advertisement to describe the target audience for the particular advertisement, stores and/or causes the display of particular advertisements. The control system may utilize any of a variety of methods to manipulate the advertising content, as described below.

[0328] The PredictAgent combines preference voting history information with contextual BM preferences to produce a rating that the TASAgent, and other system modules, use to make preference-related decisions.

[0329] PredictAgent aggregates historic votes to produce an overall rating for the modeled state. PredictAgent has the same learning architecture as ProfAgent. Unlike the ProfAgent, however, that learns feature to feature contribution metrics, PredictAgent learns the optimal instance to instance statistical parameters. Instead of PSF inputs, there are three voting history statistical inputs: sample count, sample max, and sample min, and their respective voting weights as follows:

[0330] CntPctCoef, weight for the number of times the state was visited

[0331] MaxPctCoef, weight for the maximum vote ever observed

[0332] MinPctCoef, weight for the minimum vote ever observed

[0333] The following is the pseudo code for the preference rating calculation, in the exemplary title state case:

[0334] validStates=find(cntLTitleVote);

[0335] TeffMinVote=avgLTitleVote-sdvLTitleVote;

[0336] maxTcnt=max(cntLTitleVote(validStates));

[0337] maxTmax=max(maxLTitleVote(validStates));

[0338] TcntAdj=log(cntLTitleVote(validStates))/log(maxTcnt)−log(mean(cntLTitleVote(validStates)))/log(maxTcnt);

[0339] TmaxAdj=log(maxLTitleVote(validStates))/log(maxTmax)−log(mean(maxLTitleVote(validStates)))/log(maxTmax);

[0340] TminAdj=(minLTitleVote(validStates)—mean(minLTitleVote(validStates)))/ MAxTITLeVOTE;

[0341] TeffVote=TeffMinVote+TeffMinVote.*(TcntAdj*cntPctCoef+TmaxAdj*maxPctCoef+TminAdj*minPctCoef);

[0342] The votes are assumed to have a Gaussian distribution, and a conservative rating is desired. TeffMinVote is the average vote reduced by the standard deviation of all votes. This is a voting cluster classification cut-off. MaxTcnt, and maxTmax are normalizing maximums over all state visitation counts, and highest max vote. Learned adjustment factors bias TeffMinVote according to the learned adjustments TcntAdj, TmaxAdj, and TminAdj. These vote adjustment parameters range from zero to one, and grow logarithmically with stimulus, and are further normalized by their respective average value. Such a rating policy favors consistently high observed ratings over unstable preference ratings that may average high. The state count adjustment factor gives a positive (negative) bias to more (less) frequently watched states. Thus, a one event high preference vote for an action movie, could score lower than a daily average vote for a comedy:series. This equation term helps overcomes the case where the preference rating is, for some reason, inaccurately low, but the user repeated behavior warrants a higher vote. The TmaxAdj term helps make the preference rating meaningful relative to the users preference range. That is, if a user has never demonstrated a very high rating, possibly due to poor system performance, ratings that approach the user's personal maximum, should be bias upward to indicate a relatively high score for this user.

[0343] This is especially useful when comparing ratings between users in a multi-user ID case, for example. The TminAdj vote activation level biasing term favors state votes that deviate significantly above the average minimum vote over all related states. This is a soft greedy vote skewing strategy that uses the users lowest responses as a reference point to infer high confidence in higher relative ratings.

[0344] The PDE uses the PredictAgent's global adjusted preference ratings to determine the states to replace with more preferred states, when a maximum state count is reached due to memory limitations, if any. Hence, the BM is continually updated to contain the most relevant states (potentially all visited states if memory permits).

[0345] The next step of the advertising category, prototype building process is to parameterize the BM into a pseudo Euclidean space. Since modeling data structures in the BM are not one-dimensional Gaussian distributions, determining distance between two BMs is a difficult, and inaccurate procedure when using prior art techniques. Prior art techniques assume sampled data has a bell curve shape distribution, and model the data as Gaussian, defined by a mean, μ, and variance, σ. However, as shown in FIGS. 11, 13, and 14, samples in various modeled categories are not normally distributed, but exponential, beta, uniform, delta, or multi-modal. Importantly, transition matrices do not lend themselves to standard distance metrics required to determine cluster membership. Known classification methods define a Euclidean feature space consisting of cluster neighborhoods centered at the cluster means, μ, with cluster boundaries extending σ from μ. The Mahaloanobis distance is traditionally used to discriminate cluster membership. The Mahaloanobis distance is simply the Euclidean distance divided by each cluster's dimensional σ; or,

[0346] (μ₁-μ₂)^(T)Σ⁻¹(μ₁-μ₂), where Σ is the mutual covariance matrix

[0347] This method is very inaccurate, and impractical in TV systems. It is inaccurate for two primary reasons: it falsely assumes Gaussian sample data, and the inversion of the covariance matrix introduces significant floating point round off errors that often render the matrix singular. In high dimensional space, e.g. over 100, calculating and inverting a covariance matrix inversion can be prohibitive in CPU time, and memory. In a typically sparse sample matrix, many unnecessary cross correlation terms must be manipulated. Standard methods are similarly not applicable to determining the distance between corresponding SSMs. Thus there is a need for a novel strategy to represent multi-modal clusters and distances between them.

[0348] The BM is parameterized into three general classes of behavioral dimension data types: histogram, scalar, discrete. To represent SSMs in a classification space, general, instance independent, behavioral patterns are identified, and extracted as dimensional classification parameters. Each matrix parameter is a dimension in a pseudo-Euclidean classification space.

[0349] Some typical SSM parameter categories are:

[0350] 1. Transition bias histogram

[0351] 2. Self-transition bias histogram

[0352] 3. Turn-on (off) state type bias histogram

[0353] 4. Transition reversal bias histogram

[0354] 5. Single transition ratio

[0355] 6. SSM matrix sample confidence

[0356] 7. Bias to top n states

[0357] 8. Top n states

[0358] Items 1 through 4 are distributions of observed bias for the corresponding behavioral patterns. Item 1 represents the amount of bias for transitions to occur over random. Another important behavioral category, item 2, is how likely are transitions back to the original state; i.e., going from a comedy to a comedy. Item 3 captures a user's expected session start or ending states, for all state types. Item 4 represents a distribution of bias levels to make a transition biased in one direction over another. Some scalar parameters include the ratio of single to all transitions, item 5, matrix non-random bias, item 6, and the bias to transition to the top SSM states.

[0359] The state sequence model, for all state types, has general parameterizations including: Sequence length histogram. Ratio of unique sequence states to all states visited. Fraction of liked states out of all sequence states visited. Sequence state focus. Maximum sequence length. Ratio of sequence transitions to all single transitions

[0360] Classification dimensions related to the hopping behavior are preferably parameterized as follows: T_(w)/T_(a) histogram. Δt/T_(a), histogram of program fraction times between hops. Δt, histogram of times between hops, and a histogram of number of hops per program

[0361] Finally, the system utilizes a variety of program-related feature dimensions. These dimensions include: T_(w)/trans, time watched per transition histogram. T_(w)/prog, time watched per program histogram. Ad T_(w)/T_(a), advertisement time watched per time available histogram. T_(w)/session, time watched per TV session histogram. Viewed program start time of day. T_(m)/T_(a), T_(w)/T_(a), T_(l)/T_(a) histograms. And, number of unique states visited per time period.

[0362] A detailed listing of parameterized dimensions used in the BCE need not be provided within the framework of this specification. Those of skill in the pertinent art will readily be enabled to establish the necessary parameter dimensions, including variations, parameterizations, and extrapolations.

[0363] The novel bias calculation algorithm determines the qualitative evidence for a non-uniformly random selection process; and hence, the likelihood for meaningful behavioral information. The expected uniformly random matrix bin coverage is calculated using the binomial distribution. Each user action is viewed as a pass-fail event to fill a given bin. The number of trials in the binomial experiments, or state transitions, is the number of transitions in the matrix. The probability of an event success, or filling a particular matrix bin, is the uniformly random probability that any bin is selected. The binomial probability for a given bin to be filled after a certain number of trials, translates to the number of bins in the matrix expected to be filled by a random process. Thus, the ratio of how many bins would be filled by a uniformly random process, to the actual number of bins filled, indicates a biased, or non-uniformly random, process behind state transition selections. The bias measure is additionally a quantitative indicator of a statistically significant sample size. If there are not enough samples in the matrix to infer a non-random SSM transition process, the bias measure is less than or equal to one. Prior art methods generally require n² samples in a n by n matrix to determine if the covariance matrix is expected to be statistically significant. This requirement is prohibitive as n gets large. For example, for a 30 by 30 matrix, traditional methods require 30×30, or 900 samples, which is impractical to obtain in a short period of user TV usage. The reason prior art has this constraint, is that they require enough information to infer confidence in all cross-correlation terms in the covariance matrix, since there is no a priori way to predict which are significant, even if the vast majority of these terms are zero. The present matrix bias detection method determines statistical significance continuously, and often converges on order n samples.

[0364] The following is a detailed computational description of the bias estimation technique, as applied to the Liked_Channels transition matrix.

[0365] The pseudo-code function definitions include the following:

[0366] sum(X)—sums the columns of matrix X, if X is an array sum elements to a scalar result.

[0367] length(X)—returns the greatest matrix dimension length of X.

[0368] find(X)—returns all non-zero elements of X.

[0369] X(1:5,1:5)—returns a sub-matrix X′ that is rows 1 to 5, and columns 1 to 5 of X.

[0370] Y=binocdf(X,N,P) returns the binomial cumulative distribution function with parameters N and P at the values in X.

[0371] union(A,B)—when A and B are vectors returns the combined values from A and B but with no repetitions.

[0372] sqrt(X)—the square root of the elements of X

[0373] sort(X)—sorts the elements of X in ascending order.

[0374] The following rules pertain to matrix uniform random calculations:

[0375] 1. uniform probability to transition to a certain state from a certain state:

[0376] Ptrans_rand=1/(NUM_LIKEDCHAN_STATES-1);

[0377] 2. uniform probability to choose any possible transition (do not count the TV OFF state):

[0378] state_Prob=1/sum(sum(LikedChanTransMtx(1:NUM_LIKEDCHAN_STATES,2:NUM_LIKEDCHAN_STATES)));

[0379] 3. uniform probability to start or end users session in a certain state:

[0380] PonOffRand=1/(NUM_LIKEDCHAN_STATES-1);

[0381] 4. bias vector to start in a certain state (stateOFFbias similar):

[0382] stateONbias=(LikedChanTransMtx(START_VIEWING,1:NUM_LIKEDCHAN_STATES)/ON_SESSIONS)/PonOffRand;

[0383] 5. bias over random to start-up surfing:

[0384] ViewrLchOnSurfBias(viewer_idx)=stateONbias(SURFING);

[0385] 6. bias over random to start-up in Unliked state:

[0386] ViewrChanOnUnlikeBias(viewer_idx)=stateONbias(UNLIKED);

[0387] Matrix sample concentration bias calculation follows these rules:

[0388] 1. bias as a multiple over uniformly random for non-start-end state transitions:

[0389] bias_mtx=(LikedChanTransMtx(2:NUM_LIKEDCHAN_STATES, 2:NUM_LIKEDCHAN_STATES)/Num_trans)/Ptrans_rand;

[0390] 2. number of unique transitions between non-start-end states visited by user:

[0391] numFilledBins=length(find(bias_mtx(:)));

[0392] 3. number of unique transitions between non-start-end states possible:

[0393] numBins2Fill=length(bias_mtx)^ 2;

[0394] 4. fraction of possible bins actually filled:

[0395] mtxFillRatio=numFilledBins/numBins2Fill;

[0396] 5. binomial bin selection expectation given number of samples and uniformly random success ratio:

[0397] ExpCoverage=1-binocdf(minHitsPbin-1,Num_trans,1/numBins2Fill);

[0398] 6. actual bin filling success ratio observed:

[0399] ActCoverage=numFilledBins/numBins2Fill

[0400] 7. ViewrLchMtxConf(viewer_idx)=ExpCoverage/ActCoverage

[0401] The matrix confidence ratio (MtxConf) indicates the likelihood of a non-random process bias. Thus, it tends to give the confidence that a sample set is large enough to infer it has a non-uniform-random origin. Increase the minimum hits, or successes, per bin (minHitsPbin) to increase confidence in an adequate minimum sample set size (typically, minHitsPbin=1 is practical). Inter-prototype, or local, dimensional pruning follows the BM parameterized step in the advertising category prototyping process. High variance or, similarly, low bias, dimensions are removed. The most representative classification features are those that have a tight sample distribution spread. Features with more uniformly spread data approach a uniformly random distribution, and are not as useful in cluster discrimination. A typical pruning cutoff is one standard deviation for Gaussian modeled scalar features (σ_(cut)), and a bias (β_(cut)) less than or equal to a uniformly random expected sampling spread, otherwise. The system designer achieves an increasingly strict pruning criterion by decreasing σ_(cut), and increasing β_(cut). Too strict a pruning policy, and valuable cluster separation information is lost, and could result in an empty prototype by removing all dimensions. Too relaxed a threshold results in loosing classification performance by including many non-predictive features. The product of the inter-prototype pruning phase is a preliminary advertising category template prototype. The preceding algorithms are applied to each training set, creating a locally pruned, possibly empty, reference profile for each.

[0402] After local prototype pruning, global, or intra-prototype, dimensional pruning further removes superfluous information. In this pruning stage, each advertising category prototype is compared to every other one, and dimensions that do not separate any of the clusters are removed. To measure cluster distances involving non-scalar, non-Gaussian dimensions, however, requires a novel method. Known methods define a sample point in a coherent, high dimensional space. However, the BM does not correlate, or preserve, feature values for each observation. Instead, all sample data dimensions register the observed feature values into their respective distribution modeling histograms, as if they occurred independent of time, and any other dimension. Thus, it is not possible to define clusters as sample points of the BM in an n-dimensional Euclidean space. Importantly, this tradition classification clustering approach requires exponentially more memory to store each sample point in feature space, and its transition history. Instead, the present feature space is an n-dimensional pseudo-Euclidean construct that replaces absolute distances with relative correlations between clusters. Since the sample points in each dimensions histograms have no cross-dimensional correlation, no cluster has a spatial neighborhood representation. In high dimension feature spaces, a cluster neighborhood is mainly useful the samples are Gaussian distributed, since the variance adjusted cluster means are used to calculate distances. However, in multi-modal distributions, i.e., not bell shaped, as is the present case, this representation has little advantage as Euclidean distance no longer applies in the traditional sense. Discrete feature variables, such as program names, pose an additional complication in Euclidean space, in that they are not numeric analogs of the feature dimensions, but set theory representations. To overcome the limitation of prior art, a new distance metric determines if sufficient classification distance exists between two multi-modal clusters in feature space. The present classification architecture replaces the Mahaloanobis distance, or variance adjusted Euclidean distance, of prior art with a dimensional voting architecture that estimates cluster neighborhood overlap as a percentage of dimensions that vote the overlap exists. This, alone, is not a large departure from current art, however, the metric of determining overlap between non-scalar, and non-Gaussian distributed clusters is novel. Again, there are three principle types of data, each handled differently; that is, scalar, histogram, and discrete, as defined herein. Scalar feature dimensions are modeled as Gaussian, and handled in the standard μ, σ_(cut) neighborhood discrimination method. Classification distances between corresponding histogram feature dimensions, however, are calculated as distribution correlations.

[0403] Distribution pseudo-correlation is defined as one minus the ratio of the distance between certain histogram bins, to the worst case distance. This simulates the desirable correlation behavior of:

[0404] 1. output values are between 0 and 1

[0405] 2. output linear increases (decreases) the more (dis)similar the distribution shapes and amplitudes.

[0406] The following commented procedural pseudo-code (in MatLab coding) determines if two histograms in a feature dimension belong to the same class (discretionary cutoff values are set with exemplary values):

[0407] 1. To get the worst case distance, treat each histogram bin as an orthogonal Euclidean feature vector and calculate the worst case distance between them by placing all the samples of each in different bins.

[0408] worst_diff(:)=0;

[0409] worst_diff(1)=hist1_all_samples;

[0410] worst_diff(NUM_HIST_BINS)=hist2_all_samples;

[0411] worst_distance=sqrt(worst_diff*worst_diff);

[0412] 2. Calculate the effective Euclidean distance between the two histograms

[0413] hist2hist_diff=hist1-hist2;

[0414] histDiff_sqr=hist2hist_diff.*hist2hist_diff;

[0415] user_dist=sqrt(sum(histDiff_sqr))/worst_distance;

[0416] 3. Determine the probability density functions (pdf) for each histogram

[0417] hist1_pdf=hist1/hist1_all_samples;

[0418] hist2_pdf=hist2/hist2_all_samples;

[0419] 4. Find the bins with the most distribution density, and sort on density

[0420] [hist1_mass hist1_mass_bins]=sort(hist1_pdf);

[0421] [hist2_mass hist2_mass_bins]=sort(hist2_pdf);

[0422] 5. For hist1 and hist2, the find most dense bins with one standard deviations worth of sample points

[0423] bin1_(—)1sdv=NUM_HIST_BINS-min(find(cumsum(flip1r(hist1_mass))>0.68))+1;

[0424] bin2_(—)1sdv=NUM_HIST_BINS-min(find(cumsum(flip1r(hist2_mass))>0.68))+1;

[0425] bins_(—)1sdv=union([hist1_mass_bins (bin1_(—)1sdv:NUM_HIST_BINS)], [hist2_mass_bins (bin2_(—)1sdv:NUM_HIST_BINS)]);

[0426] 6. Model the variance between histograms as the variation of the bin to bin distances. determine the average bin to bin distance between 1 sigma bins in hist1 and hist2 this is the estimated distance variation between corresponding sample points the more consistent the distance between bins, the more certain is the separation between histograms

[0427] mean_diff=mean(hist2hist_diff(bins_(—)1sdv));

[0428] deviation=hist2hist_diff(bins_(—)1sdv)-mean_diff;

[0429] variance_dist=sqrt(mean(deviation*deviation'))/worst_distance;

[0430] 7. Define histogram correlation as the ratio of the bin-wise Euclidean distance, to the worst case distance. define histogram classification correlation as the ratio of the one standard deviation bin-wise Euclidean distance, to the worst case distance.

[0431] user1sdvDist=sqrt(sum(histDiff_sqr(bins_(—)1sdv)))/worst_distance;

[0432] 8. Calculate dimension-wise clusters as separated if the sigma reduced cluster distance is positive, for all types of dimensions

[0433] ClassCutoffDims(idx)=user1sdvDist-variance_dist; %for idx=1 to NUM_DIMS

[0434] The global dimension reduction procedure removes a dimension if ClassCutoffDims for a particular classification dimension is negative over substantially all Ad prototypes, since that feature has little, or no, predictive value to the system. The result of the local, and global prototype pruning is a minimal description of important feature values that identify, and separate each advertising category.

[0435] The BCE provides the Targeting Server (TargServer—FIG. 6) with the optimized set of advertising category prototypes for download to the MemberAgent in TV. The final step in the Ad targeting system is to classify a TV user into their most likely Ad categories. The MemberAgent then applies the exact same cluster distance to the identical BM as on the server side, with the addition of the following classification steps:

[0436] 1. for all types of dimensions, calculate cluster membership as separated if the sigma reduced cluster distance is positive, then calculate the fraction of separating dimensions

[0437] ClassCutoffDims(idx)=user1sdvDist-variance_dist; %for idx=1 to NUM_DIMS goodDimVec=find(ClassCutoffDims>0); %find all separated dimensions NUM_GOOD_DIMS=length(goodDimVec);

[0438] goodDims(goodDimVec)=1;% set good Dimensions, goodDims init to 0 AdGroupClassifRatio=NUM_GOOD_DIMS/NUM_DIMS;

[0439] 2. determine pass or fail advertising category membership for system modules information CLASS_VOTE_CUT=0.4; % fraction of dimensions that must be adequately separated to count cluster as classified

[0440] %determine clusters as separated if fraction of classification vote is CLASS_VOTE_CUT if AdGroupClassifRatio>CLASS_VOTE_CUT AdGroupClusterVote=1;

[0441] else

[0442] AdGroupClusterVote=0;

[0443] end

[0444] Each advertising category group has a AdGroupClassifRatio which is the fraction of total dimensions that were adequately separated. It is a proportional measure of how similar to behavioral clusters are. That is, the more (dis)similar a user's behavior is to the advertising category prototype, the more (fewer) dimensions will overlap, hence the higher (lower) the AdGroupClassifRatio. Thus, each advertising category prototype has a AdGroupClassifRatio, or TargetingValue, that characterizes the degree that a user belongs to that targeted Ad group. The TargServer provides this information for each advertising category as a distribution of relative membership likelihoods. TargServer additionally determines a pass-fail advertising category membership value for system modules that require a binary prediction. AdGroupClusterVote is a binary membership value equal to one if there were sufficient dimensions that separated the user from the advertising category prototype under consideration, and zero otherwise.

[0445] MemberAgent periodically, or on demand, computes a user's advertising category membership likelihoods for system modules to use. The TASAgent uses advertising category membership information to store content that better matches a user's interest, or an advertising client's marketing goals. According to one embodiment, the TASAgent stores and deletes programming to statistically maximize the overall TargetingValue of the archived content.

[0446] As a basic example, consider the case where TargServer provides three templates—Male, Female, and teenager—to MemberAgent, and it calculates the TV user's membership TargetingValues as 0.2, 0.8, and 0.4. Then, TASAgent would only store Ads with metadata matching these categories, and in proportion to the TargetingValues. If the TargetingValues were normalized to sum to one, then they could be read as probabilities of Male=0.14, Female=0.29, and teenager=0.57. Hence, the TASAgent would store, and delete Ads, to match the same fractional distribution in local storage, and have stored Ads being 14% for Male, 29% for Female, and 57% for teenagers. The DispAgent similarly distributions Ad presentations to match Ad categories membership distributions. A wide variety of alternative, and more sophisticated targeting optimization strategies that fit into, or extrapolate from, this philosophy are possible.

[0447] It will be understood that inferring an advertising category from TV usage behavior is a very similar problem to identifying multiple persons in a household. The main difference is that the user prototypes are probabilistically inferred with real-time, untagged TV click-stream data. The same methodology and architecture applies to both problems; however, the multi-user identification problem principally requires additional techniques to effectively allocate TV usage observations to the correct user profile.

[0448] In addition, or as an alternative, to the foregoing description of the system to narrowly focus advertising targets, the system of the invention is also suitable to build preferred programming models. Here, the presentation agent, PresAgent interacts with the behavioral model BM to build local programming guides. PresAgent derives user presentation preferences through queries to the BMQagent. To motivate its necessity, an abridged system level summary precedes BMQengine interaction details with the PresAgent. In brief, the goal of the PresAgent is to build a programming guide for a virtual channel whose programming comes from programs locally stored by the TASAgent. The programming can be entertainment or advertising, audio, video, graphics, or any multi-media content. The TASAgent only stores the most preferred programs available, and constantly adds and deletes programs to continually fill the local storage while maximizing the overall user program preference rating. This virtual programming guide or virtual channel may have the look, and feel similar to a normal TV channel. It should seem very natural to place it as just another line in a live TV program guide. However, the virtual channel has the advantage of being customized to the user's preferences, and appears as an ‘on demand’ channel with content and showing times that largely match the viewer's personal expectations. To approach this goal, the PresAgent analyzes the stored programming presentation metadata and user's preferences to determine the optimal temporal program placement in the virtual channel's EPG (VEPG).

[0449] Program targeting metadata, especially for Ads, includes presentation information. Ad presentation metadata, from the head-end, directs the PresAgent to either follow these rules exactly, or to use local preference information to more intelligently sequence Ad content.

[0450] For non-revenue generating stored programming, the user has a similar option to direct the program arrangement of the virtual channel. Several VEPG building modes are possible, ranging from trivial, to highly context dependent.

[0451] A trivial implementation simply displays the local storage contents in the order of when they were recorded, and places paid-programming content exactly as specified in its presentation metadata. This has the advantage of simplicity, but burdens the user to search through many undesirable programs, and tends to force skipping around the guide for each program viewed. This is one step above analog VCR recordings in that it has random access, and a content listing.

[0452] A more sophisticated approach uses non-temporal program preference information to group programs of similar ratings. To the extent preference ratings are accurate, this method has the benefit of making it easier for the user to skip less liked programs, and continuously view liked programs with much less searching effort paid. However, there is still the overall feel of a sorted storage media content listing.

[0453] A significant advancement over the content preference sorting technique, uses temporal, and sequential preferences to create a VEPG ordered according to the real-time viewing context and preference history of the user. To accomplish this, when the user turns on the TV, or periodically before the TV is turned on, the PresAgent queries the BMQengine with each stored program presentation context, and dynamically builds a VEPG that best matches the user's behavioral preferences at that time and circumstance.

[0454] The following general algorithmic steps build a VEPG for a typical case:

[0455] 1. Find all undesirable viewing times, and leave them empty.

[0456] 2. Place the most likely program preferred at TV power on incurrent time slot.

[0457] 3. Find all local program transition combinations and temporal preference and sequence programs accordingly.

[0458] As a tutorial example, assume the following 9, presumed preferred, programs are locally stored: Duration Title Genre Air Time Channel (min) Market Wrap Series/Finance 1 pm weekdays CNBC 120 Star Trek Series/Sci-Fi 1 am weekdays UPN 60 Friends Series/Comedy 8 pm weekdays NBC 30 The Tonight Show Series/Talk 11:30 pm weekdays NBC 60 The Terminator Movie/Sci-Fi 9 pm Wed. HBO 150 Seinfeld Series/Comedy 7 pm weekdays FOX 30 Saturday Night Live Series/Comedy 11:30 pm weekdays NBC 90 NOVA Series/Documentary 9 pm Tues. PBS 60 NFL football Sports 6 pm Mon. ABC 210

[0459] While the TV is off, or upon turn on, the PresAgent determines the context of the current session. The current context includes information such as day of week, the time of day, time since last session, and last title/genre/channel.

[0460] The first items to determine are the time intervals never watched. This will blank out VEPG time intervals that historically often go unwatched. The query looks like:

[0461] ‘QueryFunction=time_sum, StateType=LikedChannels, fromStateID=null, toStateID=null, TimeType=TOD, TimeValue=null’.

[0462] Here we used LikedChannels as TOD activity indicator. Any other ‘liked’ state category would have served equally well.

[0463] A typical response to the TASAgent's query could be:

[0464] [(LATE_NIGHT,VERY_OFTEN); (WEE_HOURS, NEVER); (EARLY_MORNING; NEVER); (MORNING, MOSTLY); (LATE_MORNING; RARELY); (AFTER_NOON; RARELY); (LATE_AFTER_NOON; SOMETIMES); (EVENING; ALMOST_ALWAYS); (NIGHT, TYPICALLY)]

[0465] The TASAgent searches the result matrix for the least likely TOD intervals, in particular [(WEE_HOURS, NEVER),); (EARLY_MORNING; NEVER), (LATE_MORNING; RARELY); (AFTER_NOON; RARELY)].

[0466] The corresponding time intervals would be left blank in the VEPG. However, if the current TV viewing period is in a blanked interval, the current VEPG time intervals are made available for at least the user's typical TV session length. That is, upon TV turn on, there is always programming listed in the current VEPG time index, and at least as long as the user normally watches TV for that period.

[0467] The available time intervals are searched for preferential program placement.

[0468] The PresAgent proceeds to search for programming that the user prefers upon starting a TV session. Each program is searched for channel/genre/title/actor/etc. start-up preference. Each modeled behavioral state (i.e., liked chan, genre, title, etc.) is queried, and results are accumulated in a StartUpRatings matrix. A typical query to search for start-up genre preferences is:

[0469] Query([QueryFunction=top_n=5, StateType=genre, fromStateID=off, toStateID=null, TimeType=TOD, TimeValue=night]).

[0470] The same query style is repeated for each state type, and the results are compared against the available programs.

[0471] PresAgent further considers contextual preferences with respect to the last program viewed by searching through every combination of temporal and StateType transitions.

[0472] Assume that the new session's DOW=Monday, TOD=night (10 pm), last_title=‘Wheel of Fortune’@ Monday evening 7pm, last_genre=game_show, and last_channel=NBC.

[0473] A typical query includes a search for likely transitions occurring the amount of time since the last title, genre, and channel viewed, three hours (10pm-7pm) for this example. A search for the top 3 preferred title transitions three hours after watching ‘Wheel of Fortune’, is:

[0474] Query: [QueryFunction=top_n=3, StateType=Title, fromStateID=‘Wheel of Fortune’, toStateID=null, TimeType=TIP, TimeValue=3 hrs].

[0475] A similar search is repeated for genre, and channel.

[0476] PresAgent compares the bias for all StartUpRatings and last program based preferences, against the remaining programs for the best match. If, for this example, a likely start-up genre was ‘comedy series’, and the most likely start-up channel is ‘NBC’, then a matching program with the highest preference rating, say Seinfeld, would be placed as the program in the current time slot if no other transition is more preferred three hours after watching ‘Wheel of Fortune’, game_shows, or NBC.

[0477] The system keeps a table of session times for every time interval, each day of the week. If a typical session for this user at this time is 1.5 hours, then this is the time block to fill. The PresAgent tests each stored program for transitional bias to follow Seinfeld. Again, all liked state types are search for the most likely transition from the state associated with Seinfeld. A typical first query of the over all transition preference search could be:

[0478] [QueryFunction=mostLikely, StateType=Title, fromStateID=‘Seinfeld’, toStateID=null, TimeType=TOD, TimeValue=night]

[0479] PresAgent finds the closest match and places it after Seinfeld. For example, the user may have a strongest preference to watch a science documentary series after a short comedy independent of time, and NOVA would best follow. After two programs are linked, PresAgent also queries for any type of state sequence preferences; i.e., title, genre, channel, etc. For the example sequence, an initial query is:

[0480] “QueryFunction=mostLikely, StateType=TitleSequ, fromStateIDs=[“Seinfeld”, “NOVA”], LengthValue=null”

[0481] or

[0482] “QueryFunction=mostLikely, StateType=GenreSequ, fromStateIDs=[“series:comedy”, “series:science”], LengthValue=null”

[0483] PresAgent attaches the most likely and specific result to the prior sequence. This process continues for each program at the end of the growing sequence, until the typical session time block is filled. PresAgent proceeds to fill all other available VEPG time blocks. Each block of time starts with a sequence seed to grow from.

[0484] The PresAgent tests each remaining program over all available time slots, and places highly likely temporal (non-temporal, DOW, TOD, TIP) matches accordingly. For example, a typical query to check the ‘Football’ program placement preference, could start on an available Sunday afternoon slot:

[0485] Query: [QueryFunction=mostLikely, StateType=likedGenre, fromStateID=‘sports’, toStateID=null, TimeType=DOW, TimeValue=Sunday]

[0486] and

[0487] Query: [QueryFunction=mostLikely, StateType=likedGenre, fromStateID=‘sports’, toStateID=null, TimeType=TOD, TimeValue=afternoon]

[0488] If watching sports on Sunday afternoon was more likely than any other remaining program, and alternate time placement, then football would start that time block, and the herein described sequence building method would fill the rest of the session block.

[0489] The first pass of the VEPG placement algorithm only commits highly preferred programs in each context. If any programs remain for VEPG entry, subsequent iterations place the most likely programs. If there is not sufficient historic evidence to infer upon, the PresAgent makes arbitrary placements as a last resort.

[0490] Importantly, every time a viewer turns on the TV, or a new user is detected, PresAgent generates a potentially different VEPG customized to the viewers preference, and the context of that session. Several other refinements, optimizations, and extensions on the basic VEPG building mechanism are possible and contemplated. Some, herein described, additional contextual resolution techniques expand on the aforementioned algorithm. The BMQengine provides the PresAgent with many other contextual, and behavioral bias queries. Some include:

[0491] 1. Last program watched

[0492] 2. Behavioral psychometric

[0493] 3. Attention span

[0494] 4. ending bias

[0495] These measures effect sequential program placement preference as follows.

[0496] Item 1 is a mechanism to recalculate future VEPG entries based on the last program viewed by the user. Similar as in determining start-up program preferences, discussed herein, the PresAgent queries for all temporal and StateType transition preferences from the programs chosen by the user. The VEPG is rebuilt, as previously prescribed, with the most likely query result matching program as the new seed.

[0497] PresAgent uses psychometrics, item 2, such as diversity, curiosity, focus, and attention span to adjust program sequencing closer to the viewer's liking. For example, if the user has a very high (low), genre diversity or focus measures, then the PresAgent proportionately avoids (prefers) sequences that repeat the same genre. Similarly, a high (low) curiosity measure biases the PresAgent to proportionately prefer (avoid) related, but less frequented sequence candidates. A high (low) curiosity metric may arise from a user who has a low (high) attention, and often fails (succeeds) to find liked programming. Another possibility is that the user has a small core group of liked program types, but often searches beyond this group for new programs of interest. The curiosity measure, thus, looks for a user's high tendency to search outside past liked program types, with little information of why.

[0498] Attention span, item 3, detects the amount and quality of time a users tends to spend on various program aspects. A histogram models the attention distribution for each modeled parameter. Tracked parameters include any EPG category entry, such as a genre type, a title, a channel, or TV watching statistics including session times. All attention span parameters are context sensitive as supported by the BM. PresAgent uses attention span to determine the program length most preferred by the viewer in a given context. For example, a user could generally like a long drama movie, but not prefer it in the mornings before going to work, or after a game show, and most prefer it on weekend nights. This presentation filter avoids many of the obvious user program length, preference conflicts by using past time watched in a given context as a bias to favor future programs of similar length.

[0499] Once a TV session, or a VEPG program sequence, approaches the typical TV watching attention span in that context, the PresAgent has a preference to place programs that best match user's ending bias history.

[0500] Ending bias, item 4, is the past tendency to end a TV session after watching a certain BM category. An example of the ProfAgent learning a new ending bias from program replay selections, is if a user often stops watching TV in the late evening after replaying late night talk shows, such as ‘The Tonight Show’ during the week, instead of late night. The ProfAgent learns from live, and replayed program usage equally. The ability to learn preferred replaying patterns enables the PresAgent to adaptively place programming in the most preferred VEPG context. A typical TOD ending bias BMQagent query for any StateType, e.g., for talk shows, appear like:

[0501] Query: [QueryFunction=mostLikely, StateType=likedGenre, fromStateID=null, toStateID=Series/Talk, TimeType=TOD, TimeValue=late_evening].

[0502] The PresAgent, having a similar task as the PDE, creates a virtual program viewing guide that tends to match the daily variation and novelty that a user prefers.

[0503] PresAgent places VEPG Ads in a very similar fashion as non-paid programming, except placement decisions include presentation metadata and machined learned user targeting information. Ads differ from programs in another significant way, in that their initial VEPG placement is only a default initialization, subject to modification depending on the users programming choices, rights of the Ad company as communicated via controlling metadata. Although contemplated as an alternative embodiment, it is similarly possible to continually rebuild the programming VEPG based the user's in-progress viewing behavior; however, the primary benefit applies to Ad scheduling. The Ads are not necessarily visible in the VEPG, but are scheduled as inter-program and intra-program commercial breaks. The breaks are either head-end (intra-program), or internally (inter-program) generated.

[0504] The PresAgent is aware, in advance, through program metadata, or some other means, of the exact timing for intra-program Ad breaks. In the present embodiment, the PresAgent prefills all Ad breaks with optimally selected pre-stored Ads. In practice, there is a significant advantage to this procedure. Often, due to limited system resources in the TV, there is not enough time to, in real-time, calculate the best Ads to schedule in an Ad break that may be only a few minutes away. This situation usually occurs at the beginning of a program, or when someone arrives just before a scheduled Ad break. In that case, the default PresAgent sequencing of Ads is a best estimate of optimal placement. When there is enough time for calculations, the PresAgent can query the BMQengine for user Ad sequencing preferences.

[0505] The procedure to sequence Ads is the same as that for programming with the following Ad specific definitions:

[0506] 1. title is the product's UPC or Ad sponsor's name

[0507] 2. genre is the sponsoring company's main SIC

[0508] 3. The semaphore Ad_null replaces null as a query wildcard to search only Ads.

[0509] Several exemplary queries follow that demonstrate a range of Ad sequencing contextual placement capabilities.

EXAMPLE A

[0510] Find the top three products (UPC) liked at night during Seinfeld:

[0511] Query: [QueryFunction=top_n=3, StateType=title, fromStateID=Ad_null, toStateID=‘Seinfeld’, TimeType=TOD, TimeValue=night]

EXAMPLE B

[0512] Find the top 5 programs liked on Sunday after a Pepsi commercial:

[0513] Query: [QueryFunction=top_n=5, StateType=title, fromStateID=Pepsi_UPC, toStateID=null, TimeType=DOW, TimeValue=Sunday]

EXAMPLE C

[0514] Find the most liked genre at any time before an auto parts commercial:

[0515] Query: [QueryFunction=mostLikely, StateType=LikedGenre, fromStateID=null, toStateID=AutoParts_SIC, TimeType=nonTemporal, TimeValue=null]

EXAMPLE D

[0516] Of the user's liked Ads, find the top 3 Ad product categories during a sports program on Sundays:

[0517] Query: [QueryFunction=top_n=3, StateType=LikedGenre, fromStateID=sports, toStateID=Ad_null, TimeType=DOW, TimeValue=Sunday]

[0518] Having thus described the general background upon which a virtual channel and/or a virtual electronic program guide VEPG can be established, we move to describe a specific implementation of an exemplary VEPG. The PresAgent builds a default VEPG just before the user turns on the TV, or upon turn-on, that best matches the temporal, sequencing, and program preferences of the user before receiving new user input of actual choices. The PresAgent has the option, and ability when time permits, to rebuild the default VEPG in real-time based on user content selection patterns. The combination of a ‘best educated guess’ default content placement, and real-time context sensitive recalculation provides for a robust, and optimal user preference estimation.

[0519] A typical coarse VEPG generated by the PresAgent from the example set of stored programs appears as: Sunday Monday Tuesday Wednesday Thursday Friday Saturday Late Market NFL Market Market Market Afternoon Wrap football Wrap Wrap Wrap Evening Saturday Star Trek Friends NOVA Star Trek Friends The Night Live Terminator Night Seinfeld Seinfeld Seinfeld Seinfeld Seinfeld The The The The The Tonight Tonight Tonight Tonight Tonight Show Show Show Show Show

[0520] This program placement could arise from the following scenario of system-detected, user contextual preferences. ‘The Terminator’ program requires a long attention span, and although weekday nights qualify equally with Saturday night, the liking of movies largely occurs in the latter time slot. Suppose, the user has a strong general preference to watch CNBC, and financial programs during weekday late afternoons, after coming home from work. The PresAgent, furthermore, could detect that after the TASAgent recorded ‘Market Wrap’ a few times, the user watched it during this time period, and places it accordingly. However, if the PresAgent detects a stronger bias to watch Monday night ‘NFL football’ on, say, Tuesday late afternoons instead, with no financial programming ever watched, then the football game takes the latter, more preferred, slot. The user might similarly show a preference for ‘Saturday Night Live’, but on Sunday nights instead. A repeatable pattern typically could be starting a weekday night session with ‘Seinfeld’ and a strong tendency to watch, and end the session with, ‘The Tonight Show’ thereafter.

[0521] If the PresAgent detects a low (high) state diversity across a temporal context, such as daily time slot, it prefers to decrease (increase) the variety of programs in that time period. In the present example, the user has a low diversity measure in the late afternoon and night time blocks, but a much higher measure during the evening time period. In the absence of sequential or temporal bias, the PresAgent can use diversity, or curiosity information to distribute preferred programming more appropriately. In this case, the PresAgent is aware that the evening time slot is popular and the user has a similar preference for Sci-Fi, comedies, and movies. However, if the user's diversity measures are higher in this period, then the PresAgent will avoid filling the daily slot with only the most preferred daily program type, say ‘Star Trek’, and instead distribute the available slots with a variety of short, liked programming. If ‘NOVA’ has a ‘little liked’ rating in the past, a high curiosity valuation in the evening slots would motivate the PresAgent to insert ‘NOVA’ into the lineup. Impotantly, the user would find a VEPG that reflects their ‘prime time’ as night (9-12pm) instead of the traditional 8pm-10pm, and viewing pattern that matched their highly repeatable behaviors, with the periodic exceptions that arise, and fills their more exploratory, if any, periods with the range of programs that they might like.

[0522] Over time, the system detects highly repeatable preference patterns, as well as important exceptions. The selection of, and learning from, stored program usage patterns continually teaches the system when, and in what sequence program categories are preferred. A parallel description applies to optimal Ad placement. 

We claim:
 1. A method of determining a television viewer's viewing habits, the method which comprises: recording a viewer's monitor behavior with data item variables selected from the group consisting of watch date, watch start time, watch duration, and watch channel; inputting historical data information regarding demographic information tagged to the viewer; inputting program guide information; and associating the program guide information with the viewer's monitor behavior and defining therefrom a knowledge base with demographic cluster information of the viewer in terms of statistical state machine transition models.
 2. The method according to claim 1, wherein the step of defining the knowledge base comprises calculating a parameterized transition matrix defining the viewer's viewing habits, the transition matrix containing information of program transitions initiated by the viewer.
 3. The method according to claim 2, which comprises defining at least two concurrent transition matrices including a channel matrix and a genre matrix.
 4. The method according to claim 2, which comprises defining the transition matrix as a two-dimensional matrix with transitions from television channels to television channels in temporal form.
 5. The method according to claim 1, which comprises providing feedback information with the viewer's monitor behavior by recording a click stream.
 6. The method according to claim 1, which comprises parameterizing the viewer's monitor behavior with a double random pseudo hidden Markov process, and defining a low-level statistical state machine modeling a behavioral cluster and a top-level statistical state machine with active behavioral clusters and an interaction between the active behavioral clusters.
 7. The method according to claim 6, which comprises defining the double random process with a plurality of dimensions, and determining parallel statistical state machine transition events in at least two of three state categories including channel, genre, and title.
 8. A machine-readable medium having stored thereon a plurality of processor-executable instructions for implementing a function of: capturing state transitions by defining monitor behavior in a plurality of statistical state machine families each representing a given viewer or demographic group viewing behavior; combining the statistical state machine families into global statistical state machines defined in a global probability density function; updating and reinforcing the global probability density function upon determining that a given probability function has a higher confidence level than a previous probability density function; and outputting a global profile based on the global probability density function, wherein the global profile is suitable for determining programming content of a television server.
 9. The machine readable medium according to claim 8, wherein the state transitions represent a television viewer's monitor behavior and the statistical state machines are selected from the group consisting of watch date, watch start time, watch duration, and watch channel.
 10. The machine readable medium according to claim 8, wherein the global profile represents demographic cluster information of the viewer in terms of the statistical state machine transition models.
 11. The machine readable medium according to claim 8, wherein the state machines are defined in a parameterized transition matrix defining the viewer's viewing habits, the transition matrix containing information of program transitions initiated by the viewer.
 12. The machine readable medium according to claim 11, wherein the transition matrix is one of at least two concurrent transition matrices including a channel matrix and a genre matrix.
 13. The machine readable medium according to claim 8, wherein the transition matrix is a two-dimensional matrix with transitions from television channels to television channels in temporal form.
 14. The machine readable medium according to claim 8, configured to parameterize the viewer's monitor behavior with a double random pseudo hidden Markov process, and defining a low-level statistical state machine modeling a behavioral cluster and a top-level statistical state machine with active behavioral clusters and an interaction between the active behavioral clusters.
 15. The machine readable medium according to claim 8, which comprises defining the double random process with a plurality of dimensions, and determining parallel statistical state machine transition events in at least two of three state categories including channel, genre, and title. 